Indexed by:
Abstract:
For a graph G,let p(G)and c(G) denote the number of vertices in a longest path and a longest cycle in G, respectively. In this paper, we prove that if G is a 2-connected graph G onn vertices with p(G) = p, where p ≥ 20, and if G has more than 1/2(p - 2) (n - 7) + 13 edges, then p(G) - c(G) ≤ 1, which implies that every longest cycle in G is a dominating cycle.© 2009 Society for Industrial and Applied Mathematics.
Keyword:
Reprint 's Address:
Email:
Source :
SIAM Journal on Discrete Mathematics
ISSN: 0895-4801
Year: 2009
Issue: 3
Volume: 23
Page: 1238-1248
0 . 6 6 8
JCR@2009
0 . 9 0 0
JCR@2023
JCR Journal Grade:3
CAS Journal Grade:1
Cited Count:
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 1
Affiliated Colleges: