Answers are grounded in this paper and cite their sources.
"General multiplicative Zagreb indices generalize well-known multiplicative Zagreb indices of graphs. We present lower and upper bounds on the general multiplicative Zagreb indices for unicyclic graphs with given number of vertices and diameter/number of pendant vertices/cycle of given length. All bounds are best possible. Bounds on the classical multiplicative Zagreb indices of unicyclic graphs are corollaries of the general results. "
No takes yet. Share an insight, caveat, or question.
Alfuraidan et al. (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: