𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connectivity of circulant digraphs

✍ Scribed by Erik A. Van Doorn

Publisher
John Wiley and Sons
Year
1986
Tongue
English
Weight
255 KB
Volume
10
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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

πŸ“œ SIMILAR VOLUMES

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

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 .

On critically connected digraphs
On critically connected digraphs
✍ W. Mader πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 481 KB
Distance connectivity in graphs and digr
Distance connectivity in graphs and digraphs
✍ Balbuena, M. C.; Carmona, A.; Fiol, M. A. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 642 KB

Let G = ( V , A ) be a digraph with diameter D # 1. For a given integer 2 5 t 5 D , the t-distance connectivity K ( t ) of G is the minimum cardinality of an z --+ y separating set over all the pairs of vertices z, y which are a t distance d(z, y) 2 t. The t-distance edge connectivity X ( t ) of G i