✦ LIBER ✦

The Cayley graphs of ℤdand the limits of vertex-primitive graphs ofHA-type

✍ Scribed by K. V. Kostousov

Publisher: SP MAIK Nauka/Interperiodica
Year: 2007
Tongue: English
Weight: 212 KB
Volume: 48
Category: Article
ISSN: 0037-4466
DOI: 10.1007/s11202-007-0051-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cayley graphs of the group ℤ4and limits

Cayley graphs of the group ℤ4and limits for minimal vertex-primitive graphs ofHA-type

✍ K. V. Kostousov 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 402 KB

The energy of unitary cayley graphs

✍ Aleksandar Ilić 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 146 KB

where E(G) denotes the energy of G. The unitary Cayley graph X n has vertex set Z n = {0, 1, 2, . . . , n -1} and vertices a and b are adjacent, if gcd(ab, n) = 1. These graphs have integral spectrum and play an important role in modeling quantum spin networks supporting the perfect state transfer.

On the connectivity of cayley graphs

✍ Wilfried Imrich 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 282 KB

D-saturated property of the Cayley graph

D-saturated property of the Cayley graphs of

✍ Dong Yang; Xing Gao 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 265 KB

The connectivities of locally finite pri

The connectivities of locally finite primitive graphs

✍ H. A. Jung; M. E. Watkins 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 392 KB

The maximum genus of vertex-transitive g

The maximum genus of vertex-transitive graphs

✍ Martin Škoviera; Roman Nedela 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 911 KB

The maximum genus of all vertex-transitive graphs is computed. It is proved that a k-valent vertex-transitive graph of girth g is upper-embeddable whenever k 3 4 or g 2 4. Non-upper-embeddable vertex-transitive graphs are characterized. A particular attention is paid to Cayley graphs. Groups for wh