• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
成果搜索

author:

Fan, G. (Fan, G..) [1] | Ji, N. (Ji, N..) [2]

Indexed by:

Scopus

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:

Extremal graphs; Relative lengths, Paths and cycles

Community:

  • [ 1 ] [Fan, G.]Center for Discrete Mathematics, Fuzhou University, Fuzhou, Fujian 350002, China
  • [ 2 ] [Ji, N.]School of Mathematical Sciences, Xiamen University, Xiamen, Fujian 361005, China

Reprint 's Address:

  • [Fan, G.]Center for Discrete Mathematics, Fuzhou University, Fuzhou, Fujian 350002, China

Show more details

Related Keywords:

Related Article:

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:

WoS CC 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:

Online/Total:344/10795637
Address:FZU Library(No.2 Xuyuan Road, Fuzhou, Fujian, PRC Post Code:350116) Contact Us:0591-22865326
Copyright:FZU Library Technical Support:Beijing Aegean Software Co., Ltd. 闽ICP备05005463号-1