✦ LIBER ✦

On the spectral Ádám property for circulant graphs

✍ Scribed by Bernard Mans; Francesco Pappalardi; Igor Shparlinski

Book ID: 108315716
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 172 KB
Volume: 254
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00374-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Ádám's conjecture for circulant graph

On Ádám's conjecture for circulant graphs

✍ Mikhail Muzychuk 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 643 KB

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 w

On Ádám's conjecture for circulant graph

On Ádám's conjecture for circulant graphs

✍ Mikhail Muzychuk 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 651 KB

Testing set proportionality and the Ádám

Testing set proportionality and the Ádám isomorphism of circulant graphs

✍ Don Coppersmith; Nick Howgrave-Graham; Phong Q. Nguyê˜n; Igor E. Shparlinski 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Some remarks on Ádám's conjecture for si

Some remarks on Ádám's conjecture for simple directed graphs

✍ Jozef Jirásek 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 321 KB

On the metric dimension of circulant gra

On the metric dimension of circulant graphs

✍ Muhammad Imran; A.Q. Baig; Syed Ahtsham Ul Haq Bokhary; Imran Javaid 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 252 KB

On the average energy of circulant graph

On the average energy of circulant graphs

✍ Simon R. Blackburn; Igor E. Shparlinski 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 122 KB

We obtain upper and lower bounds on the average energy of circulant graphs with n vertices and regularity d. The average is taken over all representations of such graphs by circulant adjacency matrices.