典型文献
Degree Sum Conditions for Traceable Quasi-Claw-Free Graphs
文献摘要：
A traceable graph is a graph containing a Hamilton path.Let N[v]=N(v)∪{v}and J(u,v)={w ∈ N(u)∩ N(v):N(w)? N[u]∪ N[v]}.A graph G is called quasi-claw-free if J(u,v)≠ φ for any u,v ∈ V(G)with distance of two.Let σk(G)=min{∑u∈S d(v):S is an independent set of V(G)with |S|=k},where d(v)denotes the degree of v in G.In this paper,we prove that if G is a connected quasi-claw-free graph of order n and σ3(G)≥n-2,then G is traceable;moreover,we give an example to show the bound in our result is best possible.We obtain that if G is a connected quasi-claw-free graph of order n and σ2(G)≥2(n-2)/3,then G is traceable.
文献关键词：
中图分类号：
作者姓名：
Shuaijun CHEN;Xiaodong CHEN;Mingchu LI
作者机构：
College of Science,Liaoning University of Technology,Liaoning 121001,P.R.China;School of Mathematics,Liaoning Normal University,Liaoning 116029,P.R.China;School of Software,Dalian University of Technology,Liaoning 116620,P.R.China
文献出处：
引用格式：
[1]Shuaijun CHEN;Xiaodong CHEN;Mingchu LI-.Degree Sum Conditions for Traceable Quasi-Claw-Free Graphs)[J].数学研究及应用,2022(02):129-132
A类：
Traceable,Claw
B类：
Degree,Sum,Conditions,Quasi,Free,Graphs,traceable,graph,containing,Hamilton,path,Let,called,quasi,claw,free,if,any,distance,two,independent,set,where,denotes,degree,In,this,paper,we,prove,that,connected,order,then,moreover,give,example,show,bound,our,result,best,possible,We,obtain
AB值：
0.527146
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
