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

2017/01/29 by Chunxiang Wang, Wang, Chunxiang, Jia‐Bao Liu +3
Chemistry · Computer Science · Mathematics · #Combinatorics (math.CO) #Computational Drug Discovery Methods #FOS: Mathematics #Graph theory and applications #Synthesis and Properties of Aromatic Compounds

paper · pdf · doi:10.48550/arxiv.1701.08389

openalex publication_date 2017/01/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The first multiplicative Zagreb index of a graph G is the product of the square of every vertex degree, while the second multiplicative Zagreb index is the product of the degree of each edge over all edges. In our work, we explore the multiplicative Zagreb indices of bipartite graphs of order n with diameter d, and sharp upper bounds are obtained for these indices of graphs in B(n,d), where B(n, d) is the set of all n-vertex bipartite graphs with the diameter d. In addition, we explore the relationship between the maximal multiplicative Zagreb indices of graphs \textcolorbluewithin B(n, d). As consequences, those bipartite graphs with the largest, second-largest and smallest multiplicative Zagreb indices are characterized, and our results extend and enrich some known conclusions.

Citations

• Graph theory and molecular orbitals. Total φ-electron energy of alternant hydrocarbons

Related

• On the sharp upper and lower bounds of multiplicative Zagreb indices of graphs with connectivity at most k
• On the maximum and minimum multiplicative Zagreb indices of graphs with given number of cut edges
• On extremal multiplicative Zagreb indices of trees with given domination number
• On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices
• The multiplicative Zagreb indices of graphs with given connectivity or number of pendant vertices