2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices (Q2282467)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices |
scientific article; zbMATH DE number 7148541
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices |
scientific article; zbMATH DE number 7148541 |
Statements
2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices (English)
0 references
8 January 2020
0 references
In this article, the authors characterise, for \(n\) sufficiently large, all non-Hamiltonian 2-connected claw-free graphs \(G\) of order \(n\) such that \(d(u)+d(v) \geqslant \frac{2n}{5}-1\) for every edge \(uv\) of \(G\). This improves an earlier result of \textit{Z.-H. Chen} [J. Graph Theory 86, 193--212 (2017; Zbl 1370.05124)]. Various corollaries are deduced.
0 references
Hamiltonian cycle
0 references
degree sum of adjacent vertices
0 references
dominating closed trial
0 references
closure
0 references
0.8819031715393066
0 references
0.8818914890289307
0 references
0.875907838344574
0 references
0.875907838344574
0 references
0.8756915330886841
0 references
