Abstract
For \documentclass{article} \usepackage{amsmath,amsfonts,amssymb}\pagestyle{empty}\begin{document} $n\in \mathbb{N}$ \end{document} and \documentclass{article} \usepackage{amsmath,amsfonts,amssymb}\pagestyle{empty}\begin{document} $D\subseteq \mathbb{N}$ \end{document}, the distance graph P has vertex set {0,1,…,n − 1} and edge set {ij | 0 ≤ i,j ≤ n − 1,|j − i| ∈ D}. The class of distance graphs generalizes the important and very well-studied class of circulant graphs, which have been proposed for numerous network applications. In view of fault tolerance and delay issues in these applications, the connectivity and diameter of circulant graphs have been studied in great detail. Our contributions are hardness results concerning computational problems related to the connectivity and the diameter of distance graphs and a characterization of the connected distance graphs P for |D| = 2. © 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 57(4), 310-315 2011
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call