Title of article :
The lower bound for the number of 1-factors in generalized Petersen graphs
Author/Authors :
Ren ، H. - East China Normal University , Yang ، C. - Shanghai University of Engineering Science , Wang ، J. - East China Normal University
Abstract :
In this paper, we investigate the number of 1-factors of a generalized Petersen graph P(N,k) and get a lower bound for the number of 1-factors of P(N,k) as k is odd, which shows that the number of 1-factors of P(N,k) is exponential in this case and confirms a conjecture due to Lovász and Plummer (Ann. New York Acad. Sci. 576(2006), no. 1, 389-398).
Keywords :
Generalized Petersen graphs , matching , 1 , factors , Fibonacci number
Journal title :
Bulletin of the Iranian Mathematical Society
Journal title :
Bulletin of the Iranian Mathematical Society
