Symmetric and semisymmetric graphs construction using G-graphs

DOI10.1145/1073884.1073895zbMath1360.68641OpenAlexW2089033864MaRDI QIDQ5262743

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (5)

G-Graphs and Algebraic Hypergraphs ⋮ Incidence Graphs of Bipartite G-Graphs ⋮ On constructing expander families of G-graphs ⋮ G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs ⋮ A New Property of Hamming Graphs and Mesh of d-ary Trees

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