Multiplicative Zagreb indices of cacti

Abstract

Let $\prod (G)$ be Multiplicative Zagreb index of a graph G. A connected graph is a cactus graph if and only if any two of its cycles have at most one vertex in common, which has been the interest of researchers in the filed of material chemistry and graph theory. In this paper, we use a new tool to the obtain upper and lower bounds of $\prod (G)$ for all cactus graphs and characterize the corresponding extremal graphs.

Discrete Mathematics, Algorithms and Applications(accpeted) 2016

References in corpus (1)

• Multiplicative Zagreb indices of k-trees

Cited by in corpus (4)

• Bounds of Zagreb indices and hyper Zagreb indices
• On extremal multiplicative Zagreb indices of trees with given domination number
• Structure Properties of Koch Networks Based on Networks Dynamical Systems
• On extremal multiplicative Zagreb indices of trees with given number of vertices of maximum degree