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

DOI10.1016/J.DISC.2017.11.015zbMATH Open1378.05087OpenAlexW2779079174MaRDI QIDQ1690243FDOQ1690243

Slobodan Filipovski, Robert Jajcay

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

Recommendations

• Counting cycles in graphs with small excess
• Small vertex-transitive graphs of given degree and girth
• On the defect of vertex-transitive graphs of given degree and diameter
• scientific article; zbMATH DE number 2108131
• New upper bounds on the order of cages

zbMATH Keywords

lower boundgirthdegreevertex-transitive graphcage problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Moore graphs and beyond: a survey of the degree/diameter problem
• Title not available (Why is that?)
• Dynamic cage survey
• Small vertex-transitive graphs of given degree and girth
• Title not available (Why is that?)
• Regular Graphs with Given Girth and Restricted Circuits
• Title not available (Why is that?)
• The asymptotic density of sequences
• On the impossibility of certain Moore graphs
• Excess in Vertex-Transitive Graphs

Cited In (3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690243)