Abstract
Let G be a simple graph of order n and D1(G) be the set of vertices of degree 1 in G. In this paper, we prove that if G − D1(G) is 2-edge-connected and if for every edge (formula presented)(formula presented), max(d(x), d(y)) ≥ n/6−1, then for n large, L(G) is traceable with the exception of a class of well characterized graphs. A similar result in (Lai, Discrete Math 178:93–107, 1998) states that if we replace 6 by 5 in the above degree condition, then for n large, L(G) is Hamiltonian with the exception of a class of well characterized graphs.
| Original language | English |
|---|---|
| Pages (from-to) | 221-233 |
| Number of pages | 13 |
| Journal | Graphs and Combinatorics |
| Volume | 31 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Jan 2015 |
Keywords
- Dominating trail
- F-trail
- Hamiltonian cycle (path)
- Line graph
Fingerprint
Dive into the research topics of 'On Traceable Line Graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver