G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs

DOI10.1016/j.dam.2007.11.011zbMath1157.05027OpenAlexW2099424853MaRDI QIDQ948692

Luc Gillibert, Alain Bretto

Publication date: 17 October 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.11.011

zbMATH Keywords

graph theorysymmetric graphsemisymmetric graphgraphical representation of group

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

LDPC codes from cubic semisymmetric graphs ⋮ Semisymmetric graphs of order \(6p ^{2}\) and prime valency ⋮ Using bi-coset graphs to construct small regular and biregular graphs ⋮ Roughness in $G$-graphs ⋮ New graphs related to \((p,6)\) and \((p,8)\)-cages ⋮ About some robustness and complexity properties of \(G\)-graphs networks ⋮ Semisymmetric cubic graphs of order \(16p^{2}\) ⋮ On a relationship between Cayley graphs and \(G\)-graphs with some applications

Cites Work

• Constructing graphs with several pseudosimilar vertices or edges
• Note on infinite families of trivalent semisymmetric graphs
• \(G\)-graphs: a new representation of groups
• A census of semisymmetric cubic graphs on up to 768 vertices
• A classification of semisymmetric graphs of order 2pq
• Constructing cubic edge- but not vertex-transitive graphs
• Symmetric and semisymmetric graphs construction using G-graphs
• Regular line-symmetric graphs
• Computational Science - ICCS 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs