Counting cycles in graphs with small excess

MaRDI QIDQ5354845zbMATH OpenFDO

Authors Tatiana Baginová Jajcayová, Slobodan Filipovski, Robert Jajcay

Publication date 4 September 2017

zbMATH Keywords

cageexcessgirthlower boundregular graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Recommendations

• Improved lower bounds for the orders of even girth cages
• On the excess of vertex-transitive graphs of given degree and girth
• On bipartite cages of excess 4
• On graphs with cyclic defect or excess
• On graphs with excess or defect 2

Cited in

(10)

• Edge-girth-regular graphs
• On the excess of vertex-transitive graphs of given degree and girth
• On the non-existence of antipodal cages of even girth
• Spectra of orders for \(k\)-regular graphs of girth \(g\)
• Extremal edge-girth-regular graphs
• Tools for counting odd cycles in graphs
• Counting odd cycles in locally dense graphs
• Cycles in graphs with small density
• Theoretical and computational approaches to determining sets of orders for (k, g)-graphs
• Improved lower bounds for the orders of even girth cages

This page was built for publication: Counting cycles in graphs with small excess

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