Search arXivSearch

arXiv · 2605.30402

Improved Lower Bounds on the General Reduced Second Zagreb Index of Trees and Unicyclic Graphs

Abstract

For a simple graph $Γ$ and a real number $λ$, the general reduced second Zagreb index is defined by the formula $$GRM_λ(Γ)=\sum_{ab\in E(Γ)}[(°_Γ(a)+λ)(°_Γ(b)+λ)]\,.$$ A sharp lower bound for $GRM_λ$ over all trees of given order and maximum degree under the condition that $λ\ge -\frac{1}{2}$ is established. A parallel result is proved for unicyclic graphs under the condition $λ\ge -\frac{1}{2}$. The corresponding minimal trees and unicyclic graphs are identified. These findings improve upon the lower bounds previously established by Buyantogtokh, Horoldagva, and Das concerning $GRM_λ$ of trees and unicyclic graphs of given order.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nasrin Dehgardi, Sandi Klavžar, Mahdieh Azari. 2026-05-28. Improved Lower Bounds on the General Reduced Second Zagreb Index of Trees and Unicyclic Graphs. https://arxiv.org/abs/2605.30402

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO