A New Property of Hamming Graphs and Mesh of d-ary Trees

DOI10.1007/978-3-540-87827-8_11zbMath1166.68332OpenAlexW1540302009MaRDI QIDQ3597988

Alain Bretto, Cerasela Jaulin, Luc Gillibert, Bernard Laget

Publication date: 29 January 2009

Published in: Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87827-8_11

Mathematics Subject Classification ID

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

Related Items (4)

Incidence Graphs of Bipartite G-Graphs ⋮ Cayley graphs and \(G\)-graphs: some applications ⋮ Roughness in $G$-graphs ⋮ About some robustness and complexity properties of \(G\)-graphs networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New methods for using Cayley graphs in interconnection networks
• Constructing graphs with several pseudosimilar vertices or edges
• Automorphism group computation and isomorphism testing in finite groups
• Fast Fourier transform for fitness landscapes
• \(G\)-graphs: a new representation of groups
• Computing conjugacy class representatives in permutation groups.
• The carvingwidth of hypercubes
• Oriented hypercubes
• Symmetric and semisymmetric graphs construction using G-graphs

This page was built for publication: A New Property of Hamming Graphs and Mesh of d-ary Trees