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

## TL;DR

This paper establishes sharp upper bounds for the multiplicative Zagreb indices of bipartite graphs with a fixed order and diameter, characterizing extremal graphs and extending previous results in graph theory.

## Contribution

The work provides the first sharp upper bounds for these indices in bipartite graphs with given diameter and characterizes the extremal graphs, extending known theoretical results.

## Key findings

- Sharp upper bounds for multiplicative Zagreb indices are derived.
- Extremal bipartite graphs with maximum, second maximum, and minimum indices are characterized.
- Results extend and enrich existing theoretical conclusions in graph theory.

## 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 $\mathcal{B}(n,d)$, where $\mathcal{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 \textcolor{blue}{within} $\mathcal{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.