No label defined (Q3976638)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 19208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 19208 |
Statements
26 June 1992
0 references
connectivity
0 references
independent set
0 references
Hamiltonian graphs
0 references
0.8036500811576843
0 references
The author proves the following theorem: Let \(G\) be a graph of order \(n\) and connectivity \(\kappa\). If for any independent set \(S\) of cardinality \(\kappa+ 1\), \(\sum^{\kappa+ 1}_{i= 1} w_ i s_ i> \kappa(n- 1)\), where \(w_ i= \text{Min}\{2\kappa, 3i\kappa/(\kappa+ 1)\}\) and \(s_ i= |\{ x\in V(G)- S: | N(x)\cap S|= i\}|\), then \(G\) is Hamiltonian. The result, which generalizes several known sufficient conditions for Hamiltonian graphs, seems to be correct, but there is some vagueness in the proof. For the entire collection see [Zbl 0751.05025].
0 references
