Sufficient conditions for Hamiltonian properties of graphs based on the difference of Zagreb indices

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Complete characterization of graphs for direct comparing Zagreb indices
New lower bounds for the second variable Zagreb index
On difference of Zagreb indices
New sufficient conditions for cycles in graphs
On the structure and deficiency of \(k\)-trees with bounded degree
On the deficiency of bipartite graphs
Reciprocal degree distance and graph properties
Cyclic deficiency of graphs
Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs
Computation on the difference of Zagreb indices of maximal planar graphs with diameter two
Further results on the deficiency of graphs
On the extremal cacti of given parameters with respect to the difference of Zagreb indices
The deficiency of a regular graph
A generalization of hamiltonian-connected graphs
On Hamilton's ideals
Comparison between Merrifield-Simmons index and some vertex-degree-based topological indices
Note on Hamilton Circuits
5-Connected Toroidal Graphs are Hamiltonian-Connected
Reducibility among Combinatorial Problems
On the extremal graphs for Second Zagreb Index with fixed number of vertices and cyclomatic number
Bounds for neighborhood Zagreb index and its explicit expressions under some graph operations
Some Theorems on Abstract Graphs
Wiener-type invariants and Hamiltonian properties of graphs
On hyper-Zagreb index conditions for hamiltonicity of graphs
Consecutive colorings of the edges of general graphs
On Zagreb index, signless Laplacian eigenvalues and signless Laplacian energy of a graph
Hamilton-connected claw-free graphs with Ore-degree conditions
Some indices of picture fuzzy graphs and their applications
The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs
On sufficient conditions for Hamiltonicity of graphs, and beyond
A closure lemma for tough graphs and Hamiltonian degree conditions
Sufficient conditions for \(k\)-leaf-connected graphs in terms of the first Zagreb index, the reciprocal degree distance and the forgotten topological index
Hamiltonian (s, t)-paths in solid supergrid graphs
Some sufficient conditions for graphs to be \(k\)-leaf-connected
Reciprocal degree distance and Hamiltonian properties of graphs
On the exponential augmented Zagreb index of graphs
Recent studies on the super edge-magic deficiency of graphs

This page was built for publication: Sufficient conditions for Hamiltonian properties of graphs based on the difference of Zagreb indices