TY - CHAP
T1 - On the ádám conjecture on circulant graphs
AU - Mans, Bernard
AU - Pappalardi, Francesco
AU - Shparlinski, Igor
PY - 1998
Y1 - 1998
N2 - In this paper we study isomorphism between circulant graphs. Such graphs have a vast number of applications to telecommunication network, VLSI design and distributed computation [4,13,15,17]. By suitably choosing the length of the chord between two nodes of the network, one can achieve the appropriate property: e.g., low diameter, high connectivity, or implicit routing. A network that does provide labelled edges should be able to exploit the same properties as one with different labelling if the underlying graphs are isomorphic.
AB - In this paper we study isomorphism between circulant graphs. Such graphs have a vast number of applications to telecommunication network, VLSI design and distributed computation [4,13,15,17]. By suitably choosing the length of the chord between two nodes of the network, one can achieve the appropriate property: e.g., low diameter, high connectivity, or implicit routing. A network that does provide labelled edges should be able to exploit the same properties as one with different labelling if the underlying graphs are isomorphic.
UR - http://www.scopus.com/inward/record.url?scp=84919461403&partnerID=8YFLogxK
U2 - 10.1007/3-540-68535-9_29
DO - 10.1007/3-540-68535-9_29
M3 - Chapter
AN - SCOPUS:84919461403
SN - 9783540648246
T3 - Lecture Notes in Computer Science
SP - 251
EP - 260
BT - Computing and Combinatorics
A2 - Hsu, Wen-Lian
A2 - Kao, Ming-Yang
PB - Springer, Springer Nature
CY - Berlin
T2 - 4th Annual International Computing and Combinatorics Conference, COCOON 1998
Y2 - 12 August 1998 through 14 August 1998
ER -