Purely Infinite Cuntz-Krieger Algebras of Directed Graphs

For arbitrary infinite directed graphs E, the characterisationof the (not necessarily simple) Cuntz–Krieger algebrasC*(E) which are purely infinite in the sense of Kirchberg–Rørdamis given. It is also shown that C*(E) has real rank zero ifand only if the graph E satisfies Condition (K). 2000 MathematicsSubject Classification 46L05.     

On Models of Directed Path Graphs Non Rooted Directed Path Graphs

A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted directed path graph is the intersection graph of a family of directed subpaths of a rooted tree. Clearly, rooted directed path graphs are directed path graphs. Several characterizations are known for directed path graphs: one by forbidden induced subgraphs and one by forbidden asteroids. It is an open problem to find such characterizations for rooted directed path graphs. With the purpose of proving knowledge in this direction, we show in this paper properties of directed path models that can not be rooted for chordal graphs with any leafage and with leafage four. Therefore, we prove that for leafage four directed path graphs minimally non rooted directed path graphs have a unique asteroidal quadruple, and can be characterized by the presence of certain type of asteroidal quadruples.     

Constructing Infinite One-regular Graphs

A graph is said to be one-regular if its automorphism group acts regularly on the set of its arcs. A construction of an infinite family of infinite one-regular graphs of valency 4 is given. These graphs are Cayley graphs of almost abelian groups and hence of polynomial growth.     

Infinite Random Geometric Graphs

We introduce a new class of countably infinite random geometric graphs, whose vertices V are points in a metric space, and vertices are adjacent independently with probability p ? (0, 1){p \in (0, 1)} if the metric distance between the vertices is below a given threshold. For certain choices of V as a countable dense set in \mathbbRⁿ{\mathbb{R}^n} equipped with the metric derived from the L _∞-norm, it is shown that with probability 1 such infinite random geometric graphs have a unique isomorphism type. The isomorphism type, which we call GR _n , is characterized by a geometric analogue of the existentially closed adjacency property, and we give a deterministic construction of GR _n . In contrast, we show that infinite random geometric graphs in \mathbbR²{\mathbb{R}^{2}} with the Euclidean metric are not necessarily isomorphic.     

The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs

This paper deals with the isomorphism problem of directed path graphs and rooted directed path graphs. Both graph classes belong to the class of chordal graphs, and for both classes the relative complexity of the isomorphism problem is yet unknown. We prove that deciding isomorphism of directed path graphs is isomorphism complete, whereas for rooted directed path graphs we present a polynomial-time isomorphism algorithm.     

Operator Machines on Directed Graphs

We show that if an infinite-dimensional Banach space X has a symmetric basis then there exists a bounded, linear operator ${R\,:\,X\longrightarrow\, X}We show that if an infinite-dimensional Banach space X has a symmetric basis then there exists a bounded, linear operator R : X? X{R\,:\,X\longrightarrow\, X} such that the set

A = {x ? X : ||Rn x||? ￥}A = \{x \in X\,:\,{\left|\left|{R^n x}\right|\right|}\rightarrow \infty\}      7. Minimum Paths in Directed Graphs      A. Frieze 《The Journal of the Operational Research Society》1977,28(2):339-346 This paper considers the problem of finding paths from a fixed node to all other nodes of a directed graph which minimise a function defined on the paths. Under certain assumptions a characterisation of optimal paths is derived. Two algorithms which are generalisations of standard shortest path methods are then given.      8. Chip-Firing Games on Directed Graphs      Anders Björner  László Lovász 《Journal of Algebraic Combinatorics》1992,1(4):305-328 We consider the following (solitary) game: each node of a directed graph contains a pile of chips. A move consists of selecting a node with at least as many chips as its outdegree, and sending one chip along each outgoing edge to its neighbors. We extend to directed graphs several results on the undirected version obtained earlier by the authors, P. Shor, and G. Tardos, and we discuss some new topics such as periodicity, reachability, and probabilistic aspects.Among the new results specifically concerning digraphs, we relate the length of the shortest period of an infinite game to the length of the longest terminating game, and also to the access time of random walks on the same graph. These questions involve a study of the Laplace operator for directed graphs. We show that for many graphs, in particular for undirected graphs, the problem whether a given position of the chips can be reached from the initial position is polynomial time solvable.Finally, we show how the basic properties of the probabilistic abacus can be derived from our results.      9. Even Cycles in Directed Graphs      Carsten Thomassen 《European Journal of Combinatorics》1985,6(1):85-89       10. Fragments and Automorphisms of Infinite Graphs      H.A. Jung  M.E. Watkins 《European Journal of Combinatorics》1984,5(2):149-162       11. Small Directed Strongly Regular Graphs      Stefan Gyurki 《Algebra Colloquium》2020,(1):11-30 The goal of the present paper is to provide a gallery of small directed strongly regular graphs.For each graph of order n≤12 and valency k相似文献    12. Multi-Faithful Spanning Trees of Infinite Graphs      Norbert Polat 《Czechoslovak Mathematical Journal》2001,51(3):477-492 For an end and a tree T of a graph G we denote respectively by m() and m T () the maximum numbers of pairwise disjoint rays of G and T belonging to , and we define tm() := min{m T(): T is a spanning tree of G}. In this paper we give partial answers — affirmative and negative ones — to the general problem of determining if, for a function f mapping every end of G to a cardinal f() such that tm() f() m(), there exists a spanning tree T of G such that m T () = f() for every end of G.      13. Isoperimetric Constants of Infinite Plane Graphs      Serge Lawrencenko  Michael D. Plummer  Xiaoya Zha 《Discrete and Computational Geometry》2002,28(3):313-330    Abstract. Let G be an infinite locally finite plane graph with one end and let H be a finite plane subgraph of G . Denote by a(H) the number of finite faces of H and by l(H) the number of the edges of H that are on the boundary of the infinite face or a finite face not in H . Define the isoperimetric constant h (G) to be inf H l(H) / a(H) and define the isoperimetric constant h (δ) to be inf G h (G) where the infimum is taken over all infinite locally finite plane graphs G having minimum degree δ and exactly one end. We establish the following bounds on h (δ) for δ ≥ 7 :       14. Infinite Rings with Planar Zero-Divisor Graphs      Yongwei Yao 《代数通讯》2013,41(11):4068-4077 In this article, we give an extension of the Fundamental Theorem of finite dimensional algebras to the case of ?2-graded algebras. Essentially, the results are the same as in the classical case, except that the notion of a ?2-graded division algebra needs to be modified. We classify all finite dimensional ?2-graded division algebras over ? and ?.      15. On the Metric Dimension of Infinite Graphs      《Electronic Notes in Discrete Mathematics》2009 A set of vertices S resolves a connected graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of a graph G is the minimum cardinality of a resolving set. In this paper we undertake the metric dimension of infinite locally finite graphs, i.e., those infinite graphs such that all its vertices have finite degree. We give some necessary conditions for an infinite graph to have finite metric dimension and characterize infinite trees with finite metric dimension. We also establish some general results about the metric dimension of the Cartesian product of finite and infinite graphs, and obtain the metric dimension of the Cartesian product of several families of graphs.      16. 三度边正则图的三个无限族      路在平  徐明曜 《数学进展》2004,33(1):115-120 图X称为边正则图，若X的自同构群Aut(X)在X的边集上的作用是正则的．本文考察了三度边正则图与四度Cayley图的关系，给出了一个由四度Cayley图构造三度边正则图的方法，并且构造了边正则图的三个无限族．      17. 关于有向无标度图的一个推广模型(英)      颜云志  王汉兴 《运筹学学报》2011,15(1):35-45 研究了一个动态的有向随机图演化模型： 每个时间步模型随机的加入一个顶点及随机数目条依出、入度择优连接的有向边. 证明了该模型出、入度分布服从幂律且具有对称的幂律指数.      18. Inverse Eigenvalue Problems on Directed Graphs      Robert Carlson 《Transactions of the American Mathematical Society》1999,351(10):4069-4088 The differential operators and are constructed on certain finite directed weighted graphs. Two types of inverse spectral problems are considered. First, information about the graph weights and boundary conditions is extracted from the spectrum of . Second, the compactness of isospectral sets for is established by computation of the residues of the zeta function.       19. Minimally k-Edge-Connected Directed Graphs of Maximal Size      Alex R. Berg  Tibor Jordán 《Graphs and Combinatorics》2005,21(1):39-50 Let D=(V,E) be a minimally k-edge-connected simple directed graph. We prove that there is a function f(k) such that |V|f(k) implies |E|2k(|V|–k). We also determine the extremal graphs whose size attains this upper bound.Basic Research in Computer Science, funded by the Danish National Research Foundation.Supported by the MTA-ELTE Egerváry Research Group on Combinatorial Optimization, and the Hungarian Scientific Research Fund grant No. F034930, T037547, and FKFP grant No. 0143/2001. Part of this research was done when the second author visited BRICS, University of Aarhus, Denmark.      20. Random Walks on Directed Covers of Graphs      Lorenz A. Gilch  Sebastian Müller 《Journal of Theoretical Probability》2011,24(1):118-149 Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still equals the branching number, upper and lower growth rates no longer coincide in general. Furthermore, the behavior of random walks on directed covers of infinite graphs is more subtle. We provide a classification in terms of recurrence and transience and point out that the critical random walk may be recurrent or transient. Our proof is based on the observation that recurrence of the random walk is equivalent to the almost sure extinction of an appropriate branching process. Two examples in random environment are provided: homesick random walk on infinite percolation clusters and random walk in random environment on directed covers. Furthermore, we calculate, under reasonable assumptions, the rate of escape with respect to suitable length functions and prove the existence of the asymptotic entropy providing an explicit formula which is also a new result for directed covers of finite graphs. In particular, the asymptotic entropy of random walks on directed covers of finite graphs is positive if and only if the random walk is transient.

Minimum Paths in Directed Graphs

This paper considers the problem of finding paths from a fixed node to all other nodes of a directed graph which minimise a function defined on the paths. Under certain assumptions a characterisation of optimal paths is derived. Two algorithms which are generalisations of standard shortest path methods are then given.     

Chip-Firing Games on Directed Graphs

We consider the following (solitary) game: each node of a directed graph contains a pile of chips. A move consists of selecting a node with at least as many chips as its outdegree, and sending one chip along each outgoing edge to its neighbors. We extend to directed graphs several results on the undirected version obtained earlier by the authors, P. Shor, and G. Tardos, and we discuss some new topics such as periodicity, reachability, and probabilistic aspects.Among the new results specifically concerning digraphs, we relate the length of the shortest period of an infinite game to the length of the longest terminating game, and also to the access time of random walks on the same graph. These questions involve a study of the Laplace operator for directed graphs. We show that for many graphs, in particular for undirected graphs, the problem whether a given position of the chips can be reached from the initial position is polynomial time solvable.Finally, we show how the basic properties of the probabilistic abacus can be derived from our results.     

Small Directed Strongly Regular Graphs

The goal of the present paper is to provide a gallery of small directed strongly regular graphs.For each graph of order n≤12 and valency k相似文献   

Multi-Faithful Spanning Trees of Infinite Graphs

For an end and a tree T of a graph G we denote respectively by m() and m _T () the maximum numbers of pairwise disjoint rays of G and T belonging to , and we define tm() := min{m _T(): T is a spanning tree of G}. In this paper we give partial answers — affirmative and negative ones — to the general problem of determining if, for a function f mapping every end of G to a cardinal f() such that tm() f() m(), there exists a spanning tree T of G such that m _T () = f() for every end of G.     

Isoperimetric Constants of Infinite Plane Graphs

   Abstract. Let G be an infinite locally finite plane graph with one end and let H be a finite plane subgraph of G . Denote by a(H) the number of finite faces of H and by l(H) the number of the edges of H that are on the boundary of the infinite face or a finite face not in H . Define the isoperimetric constant h (G) to be inf _H l(H) / a(H) and define the isoperimetric constant h (δ) to be inf _G h (G) where the infimum is taken over all infinite locally finite plane graphs G having minimum degree δ and exactly one end. We establish the following bounds on h (δ) for δ ≥ 7 :

Infinite Rings with Planar Zero-Divisor Graphs

In this article, we give an extension of the Fundamental Theorem of finite dimensional algebras to the case of ?₂-graded algebras. Essentially, the results are the same as in the classical case, except that the notion of a ?₂-graded division algebra needs to be modified. We classify all finite dimensional ?₂-graded division algebras over ? and ?.     

On the Metric Dimension of Infinite Graphs

A set of vertices S resolves a connected graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of a graph G is the minimum cardinality of a resolving set. In this paper we undertake the metric dimension of infinite locally finite graphs, i.e., those infinite graphs such that all its vertices have finite degree. We give some necessary conditions for an infinite graph to have finite metric dimension and characterize infinite trees with finite metric dimension. We also establish some general results about the metric dimension of the Cartesian product of finite and infinite graphs, and obtain the metric dimension of the Cartesian product of several families of graphs.     

三度边正则图的三个无限族

图X称为边正则图，若X的自同构群Aut(X)在X的边集上的作用是正则的．本文考察了三度边正则图与四度Cayley图的关系，给出了一个由四度Cayley图构造三度边正则图的方法，并且构造了边正则图的三个无限族．     

关于有向无标度图的一个推广模型(英)

研究了一个动态的有向随机图演化模型： 每个时间步模型随机的加入一个顶点及随机数目条依出、入度择优连接的有向边. 证明了该模型出、入度分布服从幂律且具有对称的幂律指数.     

Inverse Eigenvalue Problems on Directed Graphs

The differential operators and are constructed on certain finite directed weighted graphs. Two types of inverse spectral problems are considered. First, information about the graph weights and boundary conditions is extracted from the spectrum of . Second, the compactness of isospectral sets for is established by computation of the residues of the zeta function.

     

Minimally k-Edge-Connected Directed Graphs of Maximal Size

Let D=(V,E) be a minimally k-edge-connected simple directed graph. We prove that there is a function f(k) such that |V|f(k) implies |E|2k(|V|–k). We also determine the extremal graphs whose size attains this upper bound.Basic Research in Computer Science, funded by the Danish National Research Foundation.Supported by the MTA-ELTE Egerváry Research Group on Combinatorial Optimization, and the Hungarian Scientific Research Fund grant No. F034930, T037547, and FKFP grant No. 0143/2001. Part of this research was done when the second author visited BRICS, University of Aarhus, Denmark.     

Random Walks on Directed Covers of Graphs

Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still equals the branching number, upper and lower growth rates no longer coincide in general. Furthermore, the behavior of random walks on directed covers of infinite graphs is more subtle. We provide a classification in terms of recurrence and transience and point out that the critical random walk may be recurrent or transient. Our proof is based on the observation that recurrence of the random walk is equivalent to the almost sure extinction of an appropriate branching process. Two examples in random environment are provided: homesick random walk on infinite percolation clusters and random walk in random environment on directed covers. Furthermore, we calculate, under reasonable assumptions, the rate of escape with respect to suitable length functions and prove the existence of the asymptotic entropy providing an explicit formula which is also a new result for directed covers of finite graphs. In particular, the asymptotic entropy of random walks on directed covers of finite graphs is positive if and only if the random walk is transient.