An improvement of Bondy's theorem on Hamilton graph condition (Q2767416)
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: An improvement of Bondy's theorem on Hamilton graph condition |
scientific article; zbMATH DE number 1697426
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improvement of Bondy's theorem on Hamilton graph condition |
scientific article; zbMATH DE number 1697426 |
Statements
29 January 2002
0 references
circumference
0 references
connectivity
0 references
tough graph
0 references
Hamilton cycle
0 references
0.9356874
0 references
0.9329112
0 references
0.9298172
0 references
0.9228497
0 references
0.9098476
0 references
0.90724075
0 references
An improvement of Bondy's theorem on Hamilton graph condition (English)
0 references
Let \(G= (V,E)\) be a graph. \(\sigma_k(G)\) is the minimum of the degree sum of every independent set of order \(k\) in \(G\). It is proved in this paper that a \(k\)-connected tough graph of order \(n\) contains a Hamilton circuit if \(\sigma_{k+1}(G)\) is at least \((k+1)(n-3)/2\). This result strengthens an early result of Bondy in 1980.
0 references
