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λ(Γ)=Σab∈ E(Γ)[(°Γ(a)+λ)(°Γ(b)+λ)]\,. A sharp lower bound for GRMλ over all trees of given order and maximum degree under the condition that λ -12 is established. A parallel result is proved for unicyclic graphs under the condition λ -12. 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.