Hits:

Indexed by:期刊论文

Date of Publication:2008-12-06

Journal:DISCRETE MATHEMATICS

Included Journals:SCIE、EI、Scopus

Volume:308

Issue:23

Page Number:5325-5333

ISSN No.:0012-365X

Key Words:Line graphs; (sub)pancyclic graph; Radius; Maximum degree; Diameter

Abstract:A graph is called subpancyclic if it contains cycles of length frorn 3 to its circumference. Let G be a graph with min{d(u)+d(v) : uv is an element of E(G)} >= 8. In this paper, we prove that if one of the following holds: the radius of G is at most left perpendicular Delta(G)/2right perpendicualr; G has no subgraph isomorphic to Y Delta(G)+2; the circumference of G is at most Delta(G) + 1; the length of a longest path is at most Delta(G) + 1, then the line graph L(G) is subpancyclic and these conditions are all best possible even under the condition that L(G) is hamiltonian. (C) 2007 Elsevier B.V. All rights reserved.