Document Type
Lecture
Publication Date
10-18-2013
Abstract
Let G be a graph with vetex set V(G) and edge set E(G). The rst generalized multiplicative Zagreb index of G is 1c (G) = v V(G) d(v)c, for a real number c > 0, and the second multiplicative Zagreb index is 2 (G) = uv E(G) d(u)d(v), where d(u)d(v) are the degrees of the vertices of uv. The multiplicative Zagreb indices have been the focus of considerable research in computational chemistry dating back to Narumi and Katayama in 1980s. In this talk, we will generalize Narumi-Katayama index and the rst multicative index, where c = 12, respectively, and investigate the lower and upper bounds for both 1c (G) and 2 (G) when G is a k-tree. Our results extend the results of Gutman for trees to k-trees. Additionally, we characterize the extremal graphs and determine the exact bounds of these indices of k-trees, which attain the lower and upper bounds.
Relational Format
presentation
Recommended Citation
Wang, Shaohui, "Multiplicative Zagreb indices of k-trees" (2013). Combinatorics Seminar. 54.
https://egrove.olemiss.edu/math_combinatorics/54
