Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8941829 | Discrete Applied Mathematics | 2018 | 11 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
TomáÅ¡ VetrÃk, Selvaraj Balachandran,