Multiplicative Zagreb indices of cacti
2016 ◽
Vol 08
(03)
◽
pp. 1650040
◽
Keyword(s):
Let [Formula: see text] be multiplicative Zagreb index of a graph [Formula: see text]. A connected graph is a cactus graph if and only if any two of its cycles have at most one vertex in common, which is a generalization of trees and has been the interest of researchers in the field of material chemistry and graph theory. In this paper, we use a new tool to obtain the upper and lower bounds of [Formula: see text] for all cactus graphs and characterize the corresponding extremal graphs.
2017 ◽
Vol 2017
◽
pp. 1-5
◽
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
2014 ◽
Vol 31
◽
pp. 56-62
◽