✦ LIBER ✦

Classifying cubic symmetric graphs of order 10por 10p2

✍ Scribed by Yanquan Feng; Jin Ho Kwak

Book ID: 107347384
Publisher: SP Science China Press
Year: 2006
Tongue: English
Weight: 353 KB
Volume: 49
Category: Article
ISSN: 1674-7283
DOI: 10.1007/s11425-006-0300-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Classifying cubic edge-transitive graphs

Classifying cubic edge-transitive graphs of order 8p

✍ Mehdi Alaeiyan; M. K. Hosseinipoor 📂 Article 📅 2009 🏛 Indian Academy of Sciences 🌐 English ⚖ 148 KB

A classification of cubic symmetric grap

A classification of cubic symmetric graphs of order 16p2

✍ MEHDI ALAEIYAN; B N ONAGH; M K HOSSEINIPOOR 📂 Article 📅 2011 🏛 Indian Academy of Sciences 🌐 English ⚖ 250 KB

Semisymmetric cubic graphs of order 16p2

✍ Mehdi Alaeiyan; Hamid A. Tavallaee; B. N. Onagh 📂 Article 📅 2010 🏛 Indian Academy of Sciences 🌐 English ⚖ 163 KB

On semisymmetric cubic graphs of order 6

On semisymmetric cubic graphs of order 6p2

✍ Zaiping Lu; Changqun Wang; Mingyao Xu 📂 Article 📅 2004 🏛 SP Science China Press 🌐 English ⚖ 305 KB

Cubic s-regular graphs of order 2p3

✍ Yan-Quan Feng; Jin Ho Kwak; Ming-Yao Xu 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract A graph is __s‐regular__ if its automorphism group acts regularly on the set of its __s__‐arcs. Malnič et al. (Discrete Math 274 (2004), 187–198) classified the connected cubic edge‐transitive, but not vertex‐transitive graphs of order 2__p__^3^ for each prime __p__. In this article, we

Hamiltonian cycles in vertex symmetric g

Hamiltonian cycles in vertex symmetric graphs of order 2P2

✍ Dragan Marušič 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 365 KB

We prove that every connected vertex symmetric graph of order 2p 2, where p is a prime, is Hamiltonian.