Vosperian and superconnected abelian Cayley digraphs (Q1175561)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Vosperian and superconnected abelian Cayley digraphs |
scientific article; zbMATH DE number 11893
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vosperian and superconnected abelian Cayley digraphs |
scientific article; zbMATH DE number 11893 |
Statements
Vosperian and superconnected abelian Cayley digraphs (English)
0 references
25 June 1992
0 references
A digraph is Vosperian if any fragment has cardinality one or \(| V(X)|-d^ +(X)-1\). A digraph is superconnected if every minimum cutset is the set of vertices adjacent from or to some vertex. The authors use a result of \textit{J. H. B. Kemperman} [Acta Math. 103, 63--88 (1960; Zbl 0108.25704)] to characterize Vosperian and superconnected abelian Cayley directed graphs, including loop networks (also called circulants).
0 references
Vosperian digraph
0 references
loop networks
0 references
