2-Spanning Cyclability Problems of Some Generalized Petersen Graphs

Autor:	Chun-Nan Hung, Lih-Hsing Hsu, Eddie Cheng, Meng-Chien Yang
Jazyk:	angličtina
Rok vydání:	2020
Předmět:	Combinatorics petersen graph Applied Mathematics 05c38 QA1-939 Discrete Mathematics and Combinatorics Generalized Petersen graph 05c45 Mathematics spanning cyclable
Zdroj:	Discussiones Mathematicae Graph Theory, Vol 40, Iss 3, Pp 713-731 (2020)
ISSN:	2083-5892
Popis:	A graph G is called r-spanning cyclable if for every r distinct vertices v1, v2, . . . , vr of G, there exists r cycles C1, C2, . . . , Cr in G such that vi is on Ci for every i, and every vertex of G is on exactly one cycle Ci. In this paper, we consider the 2-spanning cyclable problem for the generalized Petersen graph GP (n, k). We solved the problem for k ≤ 4. In addition, we provide an additional observation for general k as well as stating a conjecture.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::23d86d83586d0096795202703a9d6b75 https://doaj.org/article/67c1d7a8b45a47e688073e73478df3ce Zobrazit plný text záznamu Plný text ve formátu PDF