Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4650922 | Discrete Mathematics | 2007 | 6 Pages |
Abstract
The 2-factor index of a graph G , denoted by f(G),f(G), is the smallest integer m such that the m -iterated line graph Lm(G)Lm(G) of G contains a 2-factor. In this paper, we provide a formula for f(G)f(G), and point out that there is a polynomial time algorithm to determine f(G)f(G).
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Liming Xiong, MingChu Li,