The first Zagreb index conditions for Hamiltonian and traceable graphs

The first Zagreb index of a graph is one of the most important topological indices in chemical graph theory. It is also an important invariant of general graphs. The first Zagreb index of a graph is defined as the sum of the squares of the degrees of the vertices in the graph. The research on the Hamiltonian properties of a graph is an important topic in graph theory. Use the Diaz-Metcalf inequality, we in this paper present new sufficient conditions based on the first Zagreb index for the Hamiltonian and traceable graphs. In addition, using the ideas of obtaining the sufficient conditions, we also present an upper bound for the first Zagreb index of a graph. The graphs achieving the upper bound are also characterized.

Authors

Publication Details

Journal
Open Journal of Discrete Applied Mathematics
Published
2025-06-24
DOI
https://doi.org/10.30538/psrp-odam2025.0115
Citations
1
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
4.09
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The first Zagreb index conditions for Hamiltonian and traceable graphs

Rao Li
1 citations
Open Journal of Discrete Applied Mathematics
Graph theory and applications
4.09
article

The first Zagreb index conditions for Hamiltonian and traceable graphs

Rao Li
article en
1 citations

Abstract

The first Zagreb index of a graph is one of the most important topological indices in chemical graph theory. It is also an important invariant of general graphs. The first Zagreb index of a graph is defined as the sum of the squares of the degrees of the vertices in the graph. The research on the Hamiltonian properties of a graph is an important topic in graph theory. Use the Diaz-Metcalf inequality, we in this paper present new sufficient conditions based on the first Zagreb index for the Hamiltonian and traceable graphs. In addition, using the ideas of obtaining the sufficient conditions, we also present an upper bound for the first Zagreb index of a graph. The graphs achieving the upper bound are also characterized.

Open Journal of Discrete Applied MathematicsVol. 8(2)
Openalex Percentile: Top 9%
Graph theory and applications
4.09
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.