Degree sums and subpancyclicity in line graphs

Share/Save/Bookmark

Xiong, Liming and Broersma, H.J. and Hoede, C. and Li, Xueliang (2002) Degree sums and subpancyclicity in line graphs. Discrete Mathematics, 242 (1-3). pp. 255-267. ISSN 0012-365X

[img]PDF
Restricted to UT campus only
: Request a copy
113Kb
Abstract:A graph is called subpancyclic if it contains a cycle of length k for each k between 3 and the circumference of the graph. In this paper, we show that if the degree sum of the vertices along each 2-path of a graph G exceeds (n+6)/2, or if the degree sum of the vertices along each 3-path of G exceeds (2n+16)/3, then its line graph L(G) is subpancyclic. Simple examples show that these bounds are best possible. Our results shed some light on the content of a famous Metaconjecture of Bondy.
Item Type:Article
Copyright:© 2002 Elsevier
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/74722
Official URL:http://dx.doi.org/10.1016/S0012-365X(00)00468-4
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 206788