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.
CITATION STYLE
Mans, B., Pappalardi, F., & Shparlinski, I. (1998). On the ádám conjecture on circulant graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1449, pp. 251–260). Springer Verlag. https://doi.org/10.1007/3-540-68535-9_29
Mendeley helps you to discover research relevant for your work.