A generalization of a theorem of Diderrich in additive group theory to vertex-transitive graphs
DOI10.1006/EUJC.1996.0058zbMATH Open0862.05047OpenAlexW2082122181MaRDI QIDQ1815404FDOQ1815404
Publication date: 19 May 1997
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1996.0058
Directed graphs (digraphs), tournaments (05C20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Arithmetic and combinatorial problems involving abstract finite groups (20D60)
Cited In (2)
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- On some cyclic connectivity properties of directed graphs (examples and problems) π π
- Coin graphs, polyhedra, and conformal mapping π π
- Some approaches to a conjecture on short cycles in digraphs π π
- On Iterated Image Size for Point-Symmetric Relations π π
- Disjoint directed cycles π π
- Sufficient conditions for equality of connectivity and minimum degree of a graph π π
- Generalized degree conditions for graphs with bounded independence number π π
- Vertices of small degree in critically \(n\)-connected digraphs π π
This page was built for publication: A generalization of a theorem of Diderrich in additive group theory to vertex-transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815404)