On sufficient conditions for Hamiltonicity of graphs, and beyond

DOI10.1007/S10878-024-01110-4MaRDI QIDQ6197644

Yufei Huang, Zenan Du, Hechao Liu, Lihua You

Publication date: 20 March 2024

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

sufficient conditionHamiltonicitydifference of Zagreb indices

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40) Mathematical programming (90Cxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Hamilton's ideals
• A method in graph theory
• On difference of Zagreb indices
• Best monotone degree conditions for graph properties: a survey
• On n-Hamiltonian graphs
• A note on K-path hamiltonian graphs
• Computation on the difference of Zagreb indices of maximal planar graphs with diameter two
• On the extremal cacti of given parameters with respect to the difference of Zagreb indices
• On sufficient topological indices conditions for properties of graphs
• Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
• On the \(s\)-hamiltonianicity of an hourglass-free line graph
• On hyper-Zagreb index conditions for hamiltonicity of graphs

Cited In (3)

• Some results on vulnerability parameters and Wiener-type indices
• Sufficient conditions for Hamiltonian properties of graphs based on the difference of Zagreb indices
• Some sufficient conditions for graphs to be \(k\)-leaf-connected

This page was built for publication: On sufficient conditions for Hamiltonicity of graphs, and beyond

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