New improved lower bounds for Zagreb indices of graphs
Combinatorics
2025-08-21 v1
Abstract
This paper presents new lower bounds for the first general Zagreb index involving two, three, and four arbitrary degrees of vertices of a simple graph . For the special cases and , the results give sharper bounds for the first Zagreb index and the modified first Zagreb index , thereby improving several well-known inequalities in the literature. Furthermore, some applications of the derived bounds for are demonstrated, establishing new bounds for the second Zagreb index, the spectral radius, Nordhaus-Gaddum type bounds, and their corresponding coindices.
Keywords
Cite
@article{arxiv.2508.14678,
title = {New improved lower bounds for Zagreb indices of graphs},
author = {Mamta Verma and Ravinder Kumar},
journal= {arXiv preprint arXiv:2508.14678},
year = {2025}
}