Maximizing general first Zagreb and sum-connectivity indices for unicyclic graphs with given independence number
Keywords:
Unicyclic graph, independence number, general first Zagreb index, general sum-connectivity number, spider graph, Jensen inequality
Abstract
In this paper it is shown that in the class of unicyclic graphs of order n and independence number s, the spider graph SΔ(n, s) is the unique graph maximizing general first Zagreb index 0Rα(G) for α > 1 and general sum-connectivity index χα(G) for α ≥ 1.
