Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter

16Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

For a (molecular) graph, the first Zagreb index M1 is equal to the sum of squares of the vertex degrees, and the second Zagreb index M2 is equal to the sum of products of the degrees of a pair of adjacent vertices. In this work, we study the Zagreb indices of bipartite graphs of order n with diameter d and sharp upper bounds are obtained for M1(G) and M2(G) with G∈ℬ(n,d), where ℬ(n,d) is the set of all the n-vertex bipartite graphs with diameter d. Furthermore, we study the relationship between the maximal Zagreb indices of graphs in ℬ(n,d) and the diameter d. As a consequence, bipartite graphs with the largest, second-largest and smallest Zagreb indices are characterized. © 2010 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Li, S., & Zhang, M. (2011). Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter. Applied Mathematics Letters, 24(2), 131–137. https://doi.org/10.1016/j.aml.2010.08.032

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free