Symmetric and semisymmetric graphs construction using G-graphs

DOI10.1145/1073884.1073895zbMATH Open1360.68641OpenAlexW2089033864MaRDI QIDQ5262743FDOQ5262743

Bernard Laget, Alain Bretto, Luc Gillibert

Publication date: 16 July 2015

Published in: Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1073884.1073895

Recommendations

• G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
• Symmetry and connectivity in G-graphs
• scientific article
• scientific article; zbMATH DE number 846100
• scientific article; zbMATH DE number 7055493

zbMATH Keywords

symmetric graphssemisymmetric graph\(G\)-graphsgraphs from group

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cited In (10)

• \(GI\)-graphs: a new class of graphs with many symmetries
• Title not available (Why is that?)
• Incidence Graphs of Bipartite G-Graphs
• On constructing expander families of G-graphs
• G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
• Symmetry and connectivity in G-graphs
• Semisymmetry of generalized Folkman graphs
• A New Property of Hamming Graphs and Mesh of d-ary Trees
• Generating symmetric graphs
• G-Graphs and Algebraic Hypergraphs

This page was built for publication: Symmetric and semisymmetric graphs construction using \(G\)-graphs

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