Minimum order of loop networks of given degree and girth
From MaRDI portal
Publication:1895819
DOI10.1007/BF01929482zbMath0824.05029MaRDI QIDQ1895819
Oriol Serra, Yahya Ould Hamidoune, Anna S. Lladó
Publication date: 9 November 1995
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Yahya Ould Hamidoune's mathematical journey: a critical review of his work ⋮ On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity
Cites Work
- Unnamed Item
- Short cycles in directed graphs
- Short cycles in digraphs
- On small sumsets in an abelian group
- An application of connectivity theory in graphs to factorizations of elements in groups
- Vosperian and superconnected abelian Cayley digraphs
- On the connectivity of Cayley digraphs
- On the Addition of Elements of a Sequence
This page was built for publication: Minimum order of loop networks of given degree and girth
