General multiplicative Zagreb indices of trees

We study trees of given order, given number of pendant vertices, segments and branching vertices. We present upper and lower bounds on the general multiplicative Zagreb indices for trees of given order and number of pendant vertices/segments/branching vertices. Bounds on the first and the second mul...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2018-10, Vol.247, p.341-351
Main Authors: Vetrík, Tomáš, Balachandran, Selvaraj
Format: Article
Language:English
Subjects:
Analytical chemistry
Branching vertex
Graphs
Indicator organisms
Integer programming
Lower bounds
Molecular structure
Multiplicative Zagreb index
Pendant vertex
Segment
Segments
Tree
Trees
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study trees of given order, given number of pendant vertices, segments and branching vertices. We present upper and lower bounds on the general multiplicative Zagreb indices for trees of given order and number of pendant vertices/segments/branching vertices. Bounds on the first and the second multiplicative Zagreb indices are corollaries of the general results. We also characterize trees having the largest and the smallest indices.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2018.03.084