Let $G = (V, E)$ be a graph. The first Zagreb index and the forgotten topological index of a graph $G$ are defined respectively as $\sum_{u \in V} d^2(u)$ and $\sum_{u \in V} d^3(u)$, where $d(u)$ is the degree of vertex $u$ in $G$. If the minimum degree of $G$ is at least one, the inverse degree of $G$ is defined as $\sum_{u \in V} \frac{1}{d(u)}$. In this paper, we, for a graph with minimum degree at least one, present an upper bound for the first Zagreb index of the graph and lower bounds for the forgotten topological index and the inverse degree of the graph. We also present sufficient conditions involving the first Zagreb index, the forgotten topological index, or the inverse degree for some Hamiltonian properties of a graph.
The first Zagreb index the forgotten topological index the inverse degree Hamiltonian graph traceable graph
The author would like to extend his gratitude to the referee for his or her suggestions which improve the initial version of the paper.
| Primary Language | English |
|---|---|
| Subjects | Combinatorics and Discrete Mathematics (Excl. Physical Combinatorics) |
| Journal Section | Research Article |
| Authors | |
| Submission Date | September 18, 2024 |
| Acceptance Date | December 30, 2024 |
| Publication Date | November 3, 2025 |
| Published in Issue | Year 2025 Volume: 15 Issue: 11 |