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

zbMATH Open1190.05082MaRDI QIDQ5301650FDOQ5301650

Authors: Alain Bretto, Luc Gillibert 

Publication date: 20 January 2009

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

Mathematics Subject Classification ID

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

Cited In (12)

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

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)