In order to study the Hamiltonian properties of a quasi-claw-free graph,which is one of the extended graphs of claw-free graphs,the length difference between the longest path and the longest loop,as well as the structural characteristics of the quasi-claw-free graph is used to prove that if G is a connected n-order quasi-claw-free graph containing three independent points with a minimum degree sum of at least n,then G is traceable.
关键词
拟无爪图/支配集/可迹图/度和
Key words
quasi-claw-free graphs/dominating set/traceable graphs/degree sum
维普
万方数据