On the ádám conjecture on circulant graphs

Bernard Mans, Francesco Pappalardi, Igor Shparlinski

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

4 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationComputing and Combinatorics
Subtitle of host publication4th Annual International Conference COCOON’98 Taipei, Taiwan, R.o.C., August 12–14, 1998 Proceedings
EditorsWen-Lian Hsu, Ming-Yang Kao
Place of PublicationBerlin
PublisherSpringer, Springer Nature
Number of pages10
ISBN (Electronic)9783540685357
ISBN (Print)9783540648246
Publication statusPublished - 1998
Event4th Annual International Computing and Combinatorics Conference, COCOON 1998 - Taipei, Taiwan
Duration: 12 Aug 199814 Aug 1998

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other4th Annual International Computing and Combinatorics Conference, COCOON 1998


Dive into the research topics of 'On the ádám conjecture on circulant graphs'. Together they form a unique fingerprint.

Cite this