Abstract
For a graph, the first (multiplicative) Zagreb index is equal to the sum (product) of squares of the vertex degrees, and the second (multiplicative) Zagreb index is equal to the sum (product) of products of the degrees of a pair of adjacent vertices. In this work, by a unified approach, we determine the extremal values of these Zagreb indices in terms of the (edge) connectivity and characterize the corresponding extremal graphs among all connected bipartite graphs of order [Formula: see text]. Our results show that the extremal graphs of given (edge) connectivity regarding the Zagreb indices and multiplicative Zagreb indices do not completely coincide with other topological indices.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call