Connectedness of finite distance graphs

DOI10.1002/net.21465zbMath1269.68059OpenAlexW2001283036MaRDI QIDQ5326769

Domingo Gómez-Pérez, Álvar Ibeas, Jaime Gutierrez

Publication date: 6 August 2013

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21465

zbMATH Keywords

connectednesscirculant graphsdistance graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (1)

Network reliability: Heading out on the highway

Cites Work

• Colouring the real line
• Triple-loop networks with arbitrarily many minimum distance diagrams
• Hamiltonian properties of Toeplitz graphs
• On hamiltonian Toeplitz graphs
• The chromatic numbers of distance graphs
• Coloring of integer distance graphs
• Connectivity and diameter in distance graphs
• Circulants and their connectivities
• Cayley Digraphs of Finite Abelian Groups and Monomial Ideals
• A Combinatorial Problem Related to Multimodule Memory Organizations
• A complementary survey on double-loop networks

This page was built for publication: Connectedness of finite distance graphs