✦ LIBER ✦

Generalized petersen graphs which are cycle permutation graphs

✍ Scribed by S Stueckle; R.D Ringeisen

Book ID: 107884216
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 435 KB
Volume: 37
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(84)90068-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Which generalized petersen graphs are ca

Which generalized petersen graphs are cayley graphs?

✍ Roman Nedela; Martin Škoviera 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 572 KB

## Abstract The generalized Petersen graph __GP__ (__n, k__), __n__ ≤ 3, 1 ≥ __k__ < __n__/2 is a cubic graph with vertex‐set {u~j~; i ϵ Z~n~} ∪ {v~j~; i ϵ Z~n~}, and edge‐set {u~i~u~i~, u~i~v~i~, v~i~v~i+k, iϵ~Z~n~}. In the paper we prove that (i) __GP__(__n, k__) is a Cayley graph if and only if

Hamiltonian cycles in generalized peters

Hamiltonian cycles in generalized petersen graphs

✍ Kozo Bannai 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 363 KB

A Note on the Generalized Petersen Graph

A Note on the Generalized Petersen Graphs That Are Also Cayley Graphs

✍ Marko Lovrečič Saražin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 483 KB

The aim of this note is to present a short proof of a result of Nedela and S8 koviera (J. Graph Theory 19 (1995, 1 11)) concerning those generalized Petersen graphs that are also Cayley graphs. In that paper the authors chose the heavy weaponry of regular maps on closed connected orientable surfaces

Skewness of generalized Petersen graphs

Skewness of generalized Petersen graphs and related graphs

✍ Gek Ling Chia; Chan Lye Lee 📂 Article 📅 2012 🏛 Higher Education Press and Springer 🌐 English ⚖ 145 KB

Domination in generalized Petersen graph

Domination in generalized Petersen graphs

✍ Bohdan Zelinka 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 92 KB

Classifying 2-extendable generalized Pet

Classifying 2-extendable generalized Petersen graphs

✍ Qinglin Yu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 559 KB

A graph is said to be 2-extendable if any two edges which do not have a common vertex are contained in a l-factor of the graph. In this paper, we show that the generalized Petersen graph GP(n, k) is 2-extandable for all n # 2k or 3k whenever k 2 3, as conjectured by Cammack and Schrag.