Connectivity and diameter in distance graphs

DOI10.1002/net.20397zbMath1223.05054OpenAlexW2038646064MaRDI QIDQ3087615

Dieter Rautenbach, Lucia Draque Penso, Jayme Luiz Szwarcfiter

Publication date: 16 August 2011

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://www.db-thueringen.de/receive/dbt_mods_00012976

zbMATH Keywords

diameterconnectivitydistance graphcirculant graphmultiple loop networks

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Related Items (4)

Connectedness of finite distance graphs ⋮ Radio labelings of distance graphs ⋮ On Hamiltonian paths in distance graphs ⋮ Long cycles and paths in distance graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Colouring the real line
• Colouring prime distance graphs
• Circular chromatic numbers and fractional chromatic numbers of distance graphs
• Chromatic number of prime distance graphs
• The chromatic numbers of distance graphs
• Fault-tolerant routings in double fixed-step networks
• Coloring of integer distance graphs
• A survey on multi-loop networks.
• Integer Programming with a Fixed Number of Variables
• Circulants and their connectivities
• Connectivity of circulant digraphs
• A Combinatorial Problem Related to Multimodule Memory Organizations
• The Ring Loading Problem
• A complementary survey on double-loop networks

This page was built for publication: Connectivity and diameter in distance graphs