scientific article; zbMATH DE number 19208

MaRDI QIDQ3976638zbMATH OpenFDO

Authors Ingo Schiermeyer

Publication date 26 June 1992

zbMATH Keywords

connectivityHamiltonian graphsindependent set

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Review text

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].

Recommendations

• scientific article; zbMATH DE number 123903
• scientific article; zbMATH DE number 800108
• Neighborhood unions and Hamiltonian properties

Cited in

(4)

• Hamiltonism, degree sum and neighborhood intersections
• Claw-free graphs---a survey
• On a conjecture concerning \(k\)-Hamilton-nice sequences
• Mixed Hodges structures on punctured neighborhoods

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976638)