Further results on the lower bound on reduced Zagreb index of trees

Abstract

For a graph G, the general reduced second Zagreb index is defined as GRMλ (G) = Σuv ∈ E (deg(u) + λ) (deg(v) + λ), where λ is an arbitrary real number and deg (v) is the degree of the vertex v. In this paper, we extend and correct the equality results from [N. Dehgardia, S. Klav zar, Improved lower bounds on the general reduced second Zagreb index of trees, preprint (2023)] regarding the minimal value of GRMλ for λ ≥ -1 among trees with n vertices and a maximal degree . Furthermore, we complement these results with two distinct approaches to determine the minimum value of the general reduced second Zagreb index for molecular trees with = 3 and = 4 in λ = -2, and characterize the extremal trees.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…