We obtain lower and upper bounds on general multiplicative Zagreb indices for graphs of given clique number and order.Bounds on the basic multiplicative Zagreb indices and on the multiplicative sum Zagreb index follow from our results.We also determine graphs with the smallest and the largest indices.
No takes yet. Share an insight, caveat, or question.
Vetrík et al. (2019) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: