New graphs related to \((p,6)\) and \((p,8)\)-cages

DOI10.1016/j.camwa.2011.07.033zbMath1230.05245OpenAlexW1591998962MaRDI QIDQ660907

Luc Gillibert, Alain Bretto, Alain Faisant

Publication date: 5 February 2012

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2011.07.033

zbMATH Keywords

algorithmsalgebraic computationcomputational group theorycage graph problem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Using bi-coset graphs to construct small regular and biregular graphs ⋮ On constructing expander families of G-graphs ⋮ On a relationship between Cayley graphs and \(G\)-graphs with some applications

Cites Work

• G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
• A regular graph of girth 6 and valency 11
• Constructions for cubic graphs with large girth
• Chromatic number and the 2-rank of a graph
• Voltage graphs, group presentations and cages
• Dynamic cage survey
• \(G\)-graphs: a new representation of groups
• Cages—a survey
• A new 5‐arc‐transitive cubic graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New graphs related to \((p,6)\) and \((p,8)\)-cages