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

DOI10.1016/J.DAM.2007.11.011MaRDI QIDQ948692zbMATH OpenOpenAlexFDO

Authors Alain Bretto, Luc Gillibert

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

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

Recommendations

• Symmetric and semisymmetric graphs construction using \(G\)-graphs
• \(GI\)-graphs: a new class of graphs with many symmetries
• scientific article; zbMATH DE number 1974110
• scientific article; zbMATH DE number 3985261
• Constructing a class of symmetric graphs
• Generalized symmetry of graphs - a survey
• Symmetry and connectivity in G-graphs
• Generating symmetric graphs
• scientific article; zbMATH DE number 846100
• Generalized Gardiner-Praeger graphs and their symmetries

Cites work

• scientific article; zbMATH DE number 2185572 (Why is no real title available?)
• scientific article; zbMATH DE number 4200233 (Why is no real title available?)
• scientific article; zbMATH DE number 3823850 (Why is no real title available?)
• scientific article; zbMATH DE number 3758564 (Why is no real title available?)
• scientific article; zbMATH DE number 193034 (Why is no real title available?)
• scientific article; zbMATH DE number 1952951 (Why is no real title available?)
• scientific article; zbMATH DE number 1750091 (Why is no real title available?)
• scientific article; zbMATH DE number 863496 (Why is no real title available?)
• A census of semisymmetric cubic graphs on up to 768 vertices
• A classification of semisymmetric graphs of order 2pq
• Computational Science - ICCS 2004
• Constructing cubic edge- but not vertex-transitive graphs
• Constructing graphs with several pseudosimilar vertices or edges
• Note on infinite families of trivalent semisymmetric graphs
• Regular line-symmetric graphs
• Symmetric and semisymmetric graphs construction using \(G\)-graphs
• \(G\)-graphs: a new representation of groups

Cited in

(10)

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

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

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