The connectivity of hierarchical Cayley digraphs
โ Scribed by Y.O. Hamidoune; A.S. Llado; O. Serra
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 569 KB
- Volume
- 37-38
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
An explicit expression is derived for the connectivity of circulant digraphs.
## Abstract This paper studies the relation between the connectivity and other parameters of a digraph (or graph), namely its order __n__, minimum degree ฮด, maximum degree ฮ, diameter __D__, and a new parameter l~pi;~, __0__ โค ฯ โค ฮด โ 2, related with the number of short paths (in the case of graphs
A Cayley digraph X = Cay(G, S) is said to be normal for G if the regular representation R(G) of G is normal in the full automorphism group Aut(X ) of X . A characterization of normal minimal Cayley digraphs for abelian groups is given. In addition, the abelian groups, all of whose minimal Cayley dig