Symmetric and semisymmetric graphs construction using G-graphs
From MaRDI portal
Publication:5262743
DOI10.1145/1073884.1073895zbMath1360.68641MaRDI 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
68R10: Graph theory (including graph drawing) in computer science
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Incidence Graphs of Bipartite G-Graphs, On constructing expander families of G-graphs, G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs, G-Graphs and Algebraic Hypergraphs, A New Property of Hamming Graphs and Mesh of d-ary Trees