On the excess of vertex-transitive graphs of given degree and girth

DOI10.1016/J.DISC.2017.11.015zbMath1378.05087OpenAlexW2779079174MaRDI QIDQ1690243

Slobodan Filipovski, Jajcay, Robert

Publication date: 19 January 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.11.015

zbMATH Keywords

degreelower boundgirthvertex-transitive graphcage problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex degrees (05C07)

Related Items (3)

On biregular bipartite graphs of small excess ⋮ Improved lower bounds for the orders of even girth cages ⋮ Inverse monoids of partial graph automorphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic cage survey
• On the impossibility of certain Moore graphs
• Moore graphs and beyond: a survey of the degree/diameter problem
• Small vertex-transitive graphs of given degree and girth
• Excess in Vertex-Transitive Graphs
• Regular Graphs with Given Girth and Restricted Circuits
• The asymptotic density of sequences

This page was built for publication: On the excess of vertex-transitive graphs of given degree and girth