G-graphs for the cage problem: a new upper bound

MaRDI QIDQ5301650zbMATHFDO

Authors Alain Bretto, Luc Gillibert

Publication date 20 January 2009

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Recommendations

• New graphs related to \((p,6)\) and \((p,8)\)-cages
• New upper bounds on the order of cages
• scientific article; zbMATH DE number 3885947
• New small regular graphs of girth 5
• On upper bounds of odd girth cages

Cited in

(12)

• G-Graphs and Algebraic Hypergraphs
• On the limitations of the use of solvable groups in Cayley graph cage constructions
• Properties of groups for the cage and degree/diameter problems
• Roughness in $G$-graphs
• scientific article; zbMATH DE number 6938296 (Why is no real title available?)
• Using bi-coset graphs to construct small regular and biregular graphs
• A regular graph of girth 6 and valency 11
• New graphs related to \((p,6)\) and \((p,8)\)-cages
• Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages
• scientific article; zbMATH DE number 1409234 (Why is no real title available?)
• Incidence graphs of bipartite \(G\)-graphs
• scientific article; zbMATH DE number 3885947 (Why is no real title available?)

This page was built for publication: \(G\)-graphs for the cage problem: a new upper bound

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