Degree sums, connectivity and dominating cycles in graphs

CSpace

	Degree sums, connectivity and dominating cycles in graphs
	Sun, ZR ; Tian, F ; Wei, B
	2001
发表期刊	GRAPHS AND COMBINATORICS
ISSN	0911-0119
卷号	17 期号:3 页码:555-564
摘要	Let G be a graph of order n with connectivity kappa greater than or equal to 3 and let alpha be the independence number of G. Set sigma (4)(G) = min{Sigma (4)(i=1) d(x(i)) : {x(1), x(2), x(3), x(4)} is an independent set of G}. In this paper, we will prove that if sigma (4)(G) greater than or equal to n + 2 kappa, then there exists a longest cycle C of G such that V(G - C) is an independent set of G. Furthermore, if the minimum degree of G is at least alpha, then G is hamiltonian.
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000172951700013
出版者	SPRINGER JAPAN KK
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/13956
专题	中国科学院数学与系统科学研究院
通讯作者	Sun, ZR
作者单位	1.Nanjing Normal Univ, Dept Math, Nanjing 210097, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China 3.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Sun, ZR,Tian, F,Wei, B. Degree sums, connectivity and dominating cycles in graphs[J]. GRAPHS AND COMBINATORICS,2001,17(3):555-564.
APA	Sun, ZR,Tian, F,&Wei, B.(2001).Degree sums, connectivity and dominating cycles in graphs.GRAPHS AND COMBINATORICS,17(3),555-564.
MLA	Sun, ZR,et al."Degree sums, connectivity and dominating cycles in graphs".GRAPHS AND COMBINATORICS 17.3(2001):555-564.