Authors: E. Cheng, L.-H. Hsu, C.-N. Hung, M.-C. Yang Title: 2-spanning cyclability problems of the some generalized Petersen graphs Source: Discussiones Mathematicae Graph Theory Received 18.09.2017, Revised 05.03.2018, Accepted 05.03.2018, doi: 10.7151/dmgt.2150 | |
Abstract: A graph G is called r-spanning cyclable if for every r distinct vertices v_{1},v_{2},...,v_{r} of G, there exists r cycles C_{1},C_{2},..., C_{r} in G such that v_{i} is on C_{i} for every i, and every vertex of G is on exactly one cycle C_{i}. 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. | |
Keywords: Petersen graph, spanning cyclable | |
Links: |