scholarly journals Characterization of (m, 1)-transitive and (3,2)-transitive semi-complete directed graphs

1994 ◽  
Vol 135 (1-3) ◽  
pp. 335-347 ◽  
Author(s):  
Zsolt Tuza
Keyword(s):  
Directed Graphs

Quadratic-monomial generated domains from mixed signed, directed graphs

2019 ◽  
Vol 29 (02) ◽  
pp. 279-308
Author(s):  
Michael A. Burr ◽  
Drew J. Lipman
Keyword(s):  
Directed Graphs ◽  
Complete Characterization ◽  
Combinatorial Structure ◽  
Signed Directed Graph ◽  
Odd Cycle ◽  
Combinatorial Classification ◽  
Special Case ◽  
Text Condition

Determining whether an arbitrary subring [Formula: see text] of [Formula: see text] is a normal or Cohen-Macaulay domain is, in general, a nontrivial problem, even in the special case of a monomial generated domain. We provide a complete characterization of the normality, normalizations, and Serre’s [Formula: see text] condition for quadratic-monomial generated domains. For a quadratic-monomial generated domain [Formula: see text], we develop a combinatorial structure that assigns, to each quadratic monomial of the ring, an edge in a mixed signed, directed graph [Formula: see text], i.e. a graph with signed edges and directed edges. We classify the normality and the normalizations of such rings in terms of a generalization of the combinatorial odd cycle condition on [Formula: see text]. We also generalize and simplify a combinatorial classification of Serre’s [Formula: see text] condition for such rings and construct non-Cohen–Macaulay rings.

A dynamical characterization of diagonal-preserving -isomorphisms of graph -algebras

2017 ◽  
Vol 38 (7) ◽  
pp. 2401-2421 ◽  
Author(s):  
SARA E. ARKLINT ◽  
SØREN EILERS ◽  
EFREN RUIZ
Keyword(s):  
Directed Graphs ◽  
Sufficient Condition ◽  
Orbit Equivalence ◽  
Necessary And Sufficient Condition ◽  
Graph Algebras ◽  
Boundary Path ◽  
Necessary And Sufficient

We characterize when there exists a diagonal-preserving $\ast$-isomorphism between two graph $C^{\ast }$-algebras in terms of the dynamics of the boundary path spaces. In particular, we refine the notion of ‘orbit equivalence’ between the boundary path spaces of the directed graphs $E$ and $F$ and show that this is a necessary and sufficient condition for the existence of a diagonal-preserving $\ast$-isomorphism between the graph $C^{\ast }$-algebras $C^{\ast }(E)$ and $C^{\ast }(F)$.

A Behavioral Characterization of Discrete Time Dynamical Systems over Directed Graphs

2014 ◽  
Vol 13 (1) ◽  
pp. 161-180 ◽  
Author(s):  
Jonathan Ackerman ◽  
Kimberly Ayers ◽  
Eduardo J. Beltran ◽  
Joshua Bonet ◽  
Devin Lu ◽  
...  
Keyword(s):  
Dynamical Systems ◽  
Discrete Time ◽  
Directed Graphs ◽  
Behavioral Characterization ◽  
Discrete Time Dynamical Systems

scholarly journals A Construction for the Hat Problem on a Directed Graph

10.37236/1994 ◽  
2012 ◽  
Vol 19 (1) ◽  
Author(s):  
Rani Hod ◽  
Marcin Krzywkowski
Keyword(s):  
Directed Graph ◽  
Directed Graphs ◽  
Maximum Clique ◽  
Clique Number ◽  
Bipartite Graphs ◽  
The Other ◽  
Complete Graphs ◽  
Undirected Graphs ◽  
Asymptotically Optimal

A team of $n$ players plays the following game. After a strategy session, each player is randomly fitted with a blue or red hat. Then, without further communication, everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. Visibility is defined by a directed graph; that is, vertices correspond to players, and a player can see each player to whom he is connected by an arc. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The team aims to maximize the probability of a win, and this maximum is called the hat number of the graph.Previous works focused on the hat problem on complete graphs and on undirected graphs. Some cases were solved, e.g., complete graphs of certain orders, trees, cycles, and bipartite graphs. These led Uriel Feige to conjecture that the hat number of any graph is equal to the hat number of its maximum clique.We show that the conjecture does not hold for directed graphs. Moreover, for every value of the maximum clique size, we provide a tight characterization of the range of possible values of the hat number. We construct families of directed graphs with a fixed clique number the hat number of which is asymptotically optimal. We also determine the hat number of tournaments to be one half.

scholarly journals Complexity and polymorphisms for digraph constraint problems under some basic constructions

2016 ◽  
Vol 26 (07) ◽  
pp. 1395-1433 ◽  
Author(s):  
Marcel Jackson ◽  
Tomasz Kowalski ◽  
Todd Niven
Keyword(s):  
Directed Graphs ◽  
Complete Characterization ◽  
Constraint Satisfaction Problems ◽  
Local Consistency ◽  
First Order ◽  
Graph Theoretic ◽  
The Stability ◽  
Basic Graph

The role of polymorphisms in determining the complexity of constraint satisfaction problems is well established. In this context, we study the stability of CSP complexity and polymorphism properties under some basic graph theoretic constructions. As applications we observe a collapse in the applicability of algorithms for CSPs over directed graphs with both a total source and a total sink: the corresponding CSP is solvable by the “few subpowers algorithm” if and only if it is solvable by a local consistency check algorithm. Moreover, we find that the property of “strict width” and solvability by few subpowers are unstable under first-order reductions. The analysis also yields a complete characterization of the main polymorphism properties for digraphs whose symmetric closure is a complete graph.

scholarly journals The Wold-Type Decomposition for m-Isometries

2021 ◽  
Author(s):  
Jakub Kośmider
Keyword(s):  
Composition Operators ◽  
Directed Graphs ◽  
Equivalent Condition ◽  
Weighted Shifts ◽  
Type Decomposition

AbstractThe aim of this paper is to study the Wold-type decomposition in the class of m-isometries. One of our main results establishes an equivalent condition for an analytic m-isometry to admit the Wold-type decomposition for $$m\ge 2$$ m ≥ 2 . In particular, we introduce the k-kernel condition which we use to characterize analytic m-isometric operators which are unitarily equivalent to unilateral operator valued weighted shifts for $$m\ge 2$$ m ≥ 2 . As a result, we also show that m-isometric composition operators on directed graphs with one circuit containing only one element are not unitarily equivalent to unilateral weighted shifts. We also provide a characterization of m-isometric unilateral operator valued weighted shifts with positive and commuting weights.

scholarly journals $$\varvec{m}$$–Isometric Composition Operators on Directed Graphs with One Circuit

2021 ◽  
Vol 93 (5) ◽  
Author(s):  
Zenon Jan Jabłoński ◽  
Jakub Kośmider
Keyword(s):  
Composition Operators ◽  
Directed Graphs ◽  
Weighted Shifts ◽  
Completion Problem ◽  
Affirmative Solution

AbstractThe aim of this paper is to investigate m–isometric composition operators on directed graphs with one circuit. We establish a characterization of m–isometries and prove that complete hyperexpansivity coincides with 2–isometricity within this class. We discuss the m–isometric completion problem for unilateral weighted shifts and for composition operators on directed graphs with one circuit. The paper is concluded with an affirmative solution of the Cauchy dual subnormality problem in the subclass with circuit containing one element.

A Minimax Equality Related to the Longest Directed Path in an Acyclic Graph

1975 ◽  
Vol 27 (2) ◽  
pp. 348-351 ◽  
Author(s):  
K. Vidyasankar ◽  
D. H. Younger
Keyword(s):  
Directed Graph ◽  
Directed Graphs ◽  
Directed Path ◽  
Acyclic Graph ◽  
Vertex Set ◽  
Acyclic Directed Graph

As an analog of a recently established minimax equality for directed graphs [1], I. Simon has suggested that the following be investigated.1.1. For a finite acyclic directed graph G, a minimum collection of directed coboundaries whose union is the edge set of G has cardinality equal to that of a maximum strong matching of G.This minimax equality is here proved, using a characterization of a maximum strong matching of an acyclic graph as the set of edges of a longest directed path in the graph.The terms employed in the above theorem are defined as follows. Let G be a finite directed graph with vertex set VG and edge set eG

scholarly journals A Class of Limit Algebras Associated with Directed Graphs

2007 ◽  
Vol 82 (3) ◽  
pp. 345-368 ◽  
Author(s):  
David W. Kribs ◽  
Baruch Solel
Keyword(s):  
Hilbert Space ◽  
Directed Graphs ◽  
Weighted Shifts ◽  
Simple Loop ◽  
C Algebras ◽  
Natural Notion ◽  
Factor Maps ◽  
Positive Integers ◽  
Fixed Period

AbstractEvery directed graph defines a Hilbert space and a family of weighted shifts that act on the space. We identify a natural notion of periodicity for such shifts and study their C* -algebras. We prove the algebras generated by all shifts of a fixed period are of Cuntz-Krieger and Toeplitz-Cuntz-Krieger type. The limit C* -algebras determined by an increasing sequence of positive integers, each dividing the next, are proved to be isomorphic to Cuntz-Pimsner algebras and the linking maps are shown to arise as factor maps. We derive a characterization of simplicity and compute the K-groups for these algebras. We prove a classification theorem for the class of algebras generated by simple loop graphs.

INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES

1991 ◽  
Vol 01 (01) ◽  
pp. 127-146 ◽  
Author(s):  
C. J. ASH
Keyword(s):  
Directed Graphs ◽  
Multiplication Table ◽  
Type Ii ◽  
Similar Characterization ◽  
Regular Monoid ◽  
Related Group ◽  
A Finite Group ◽  
Independent Work ◽  
Relational Morphism

We verify the "Type II Conjecture" concerning the question of which elements of a finite monoid M are related to the identity in every relational morphism with a finite group. We confirm that these elements form the smallest submonoid, K, of M (containing 1 and) closed under "weak conjugation", that is, if x ∈ K, y ∈ M, z ∈ M and yzy = y then yxz ∈ K and zxy ∈ K. More generally, we establish a similar characterization of those directed graphs having edges are labelled with elements of M which have the property that for every such relational morphism there is a choice of related group elements making the corresponding labelled graph "commute". We call these "inevitdbleM-graph". We establish, using this characterization, an effective procedure for deciding from the multiplication table for M whether an "M-graph" is inevitable. A significant stepping–stone towards this was Tilson's 1986 construction which established the Type II Conjecture for regular monoid elements, and this construction is used here in a slightly modified form. But substantial credit should also be given to Henckell, Margolis, Meakin and Rhodes, whose recent independent work follows lines very similar to our own.

Sign in / Sign up

Export Citation Format

Share Document