On Ádám's conjecture for circulant graphs

✍ Scribed by Mikhail Muzychuk

• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 643 KB
• Volume: 167-168
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/s0012-365x(96)00251-8

✦ Synopsis

Adfim's (1967)

conjecture formulates necessary and sufficient conditions for cyclic (circulant) graphs to be isomorphic. It is known that the conjecture fails if n is divisible by either 8 or by an odd square. On the other hand, it was shown in [?] that the conjecture is true for circulant graphs with square-free number of vertices. In this paper we prove that Ad/lm's conjecture remains also true if the number of vertices of a graph is twice squarefree.