An upper bound on the sum of squares of degrees in a graph
Discrete Mathematics
(n,e)-Graphs with maximum sum of squares of degrees*
Journal of Graph Theory
Minimizer graphs for a class of extremal problems
Journal of Graph Theory
Trees of extremal connectivity index
Discrete Applied Mathematics
Sharp bounds for Zagreb indices of maximal outerplanar graphs
Journal of Combinatorial Optimization
Sharp bounds on the zeroth-order general Randić indices of conjugated bicyclic graphs
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.04 |
For a graph, the first Zagreb index M"1 is equal to the sum of the squares of degrees, and the second Zagreb index M"2 is equal to the sum of products of degrees of pairs of adjacent vertices. In this paper, we determine sharp bounds for both M"1 and M"2 of n-vertex bicyclic graphs with k pendant vertices.