2000 character limit reached
The First Zagreb Index Conditions for Some Hamiltonian Properties of Graphs
Published 4 Sep 2024 in math.CO | (2409.02593v1)
Abstract: Let $G = (V, E)$ be a graph. The first Zagreb index of a graph $G$ is defined as $\sum_{u \in V} d2(u)$, where $d(u)$ is the degree of vertex $u$ in $G$. Using the P\'{o}lya-Szeg\H{o} inequality, we in this paper present the first Zagreb index conditions for some Hamiltonian properties of a graph and an upper bound for the first Zagreb index of a graph.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.