Circulant graphs and tessellations on flat tori

DOI10.1016/j.laa.2009.08.040zbMath1211.52016OpenAlexW1985561734MaRDI QIDQ1044617

T. B. Carlos, Sueli I. R. Costa, João Eloir Strapasson, Marcelo Muniz Silva Alves

Publication date: 18 December 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.08.040

zbMATH Keywords

latticescirculant graphsgenus of circulant graphsgraphs on flat toriLee codes

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Linear codes (general theory) (94B05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

Topological network entanglement as order parameter for the emergence of geometry ⋮ Diameters of random circulant graphs ⋮ The Pfaffian property of circulant graphs ⋮ On Motzkin's problem in the circle group ⋮ Optimum commutative group codes ⋮ Unnamed Item

Cites Work

• On the algebraic connectivity of graphs as a function of genus
• On perfect Lee codes
• Geometry of surfaces
• Circulant graph imbeddings
• On planarity and colorability of circulant graphs
• Ádám's conjecture is true in the square-free case
• Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems
• Circulants and their connectivities
• Graphs, Tessellations, and Perfect Codes on Flat Tori
• The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
• Quasi-perfect Lee distance codes
• Graphs with circulant adjacency matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Circulant graphs and tessellations on flat tori