✦ LIBER ✦

Infinite Circulant Digraphs and Random Infinite Circulant Digraphs

✍ Scribed by Qiang Xiang Huang; Ji Xiang Meng; Fu Ji Zhang

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2002
Tongue: English
Weight: 135 KB
Volume: 18
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-002-0220-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Automorphism Groups of Minimal Infin

The Automorphism Groups of Minimal Infinite Circulant Digraphs

✍ Jixiang Meng; Huang Qiongxing 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 187 KB

An infinite circulant digraph is a Cayley digraph of the cyclic group of Z of integers . Here we prove that the full automorphism group of any strongly connected infinite circulant digraph over minimal generating set is just the group of translations of Z . We also present some related conjectures .

Connectivity of circulant digraphs

✍ Erik A. Van Doorn 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

An explicit expression is derived for the connectivity of circulant digraphs.

On arc-transitive circulant digraphs

✍ Huang Qiongxiang 📂 Article 📅 1997 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 413 KB

Characterization of c-circulant digraphs

Characterization of c-circulant digraphs of degree two which are circulant

✍ J.M. Brunat; M. Maureso; M. Mora 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 796 KB

A c-circulant digraph G,(c, A) has Z,V as its vertex set and adjacency rules given by .X + cs + a with a E A c Z,. The c-circulant digraphs of degree two which are isomorphic to some circulant digraph are characterized, and the corresponding isomorphism is given. Moreover. a sufficient condition is

On non-Hamiltonian circulant digraphs of

On non-Hamiltonian circulant digraphs of outdegree three

✍ Locke, Stephen C.; Witte, Dave 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

We construct infinitely many connected, circulant digraphs of outdegree three that have no Hamiltonian circuit. All of our examples have an even number of vertices, and our examples are of two types: either every vertex in the digraph is adjacent to two diametrically opposite vertices, or every vert

Infinite digraphs with nonreconstructibl

Infinite digraphs with nonreconstructible outvalency sequences

✍ C. S. T. J. A. Nash-Williams 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

## Abstract We show that the outvalency sequence of an infinite digraph is not, in general, reconstructible.