Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter (1701.08389v2)

Published 29 Jan 2017 in math.CO

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.

Summary

We haven't generated a summary for this paper yet.