| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949548 | Discrete Applied Mathematics | 2017 | 8 Pages |
Abstract
The first multiplicative Zagreb index of a graph G is the product of the square of every vertex degree, while the second multiplicative Zagreb index is the product of the products of degrees of pairs of adjacent vertices. In this paper, we explore the trees in terms of given number of vertices of maximum degree. The maximum and minimum values of â1(G) and â2(G) of trees with arbitrary number of maximum degree are provided. In addition, the corresponding extremal graphs are characterized.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Shaohui Wang, Chunxiang Wang, Lin Chen, Jia-Bao Liu,