Connectivity and diameter in distance graphs
- 20 June 2010
- Vol. 57 (4), 310-315
- https://doi.org/10.1002/net.20397
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A survey on multi-loop networksTheoretical Computer Science, 2003
- A complementary survey on double-loop networksTheoretical Computer Science, 2001
- Coloring of integer distance graphsDiscrete Mathematics, 1998
- Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance GraphsEuropean Journal of Combinatorics, 1998
- Fault-tolerant routings in double fixed-step networksDiscrete Applied Mathematics, 1997
- The chromatic numbers of distance graphsDiscrete Mathematics, 1997
- Distributed Loop Computer-Networks: A SurveyJournal of Parallel and Distributed Computing, 1995
- Colouring prime distance graphsGraphs and Combinatorics, 1990
- Colouring the real lineJournal of Combinatorial Theory, Series B, 1985
- Circulants and their connectivitiesJournal of Graph Theory, 1984