Multiplicative Zagreb indices of k-trees
From MaRDI portal
Abstract: Let G be a graph with vertex set V (G) and edge set E(G). The first generalized multiplicative Zagreb index of G is M_1(G) and the second multiplicative Zagreb index is M_2(G). The multiplicative Zagreb indices have been the focus of considerable research in computational chemistry dating back to Narumi and Katayama in 1980s. In this paper, we generalize Narumi-Katayama index and the first multiplicative index, where c = 1, 2, respectively, and extend the results of Gutman to the generalized tree, the k-tree, where the results of Gutman are for k = 1. Additionally, we characterize the extremal graphs and determine the exact bounds of these indices of k-trees, which attain the lower and upper bounds.
Recommendations
- Multiplicative Zagreb indices of trees
- On extremal multiplicative Zagreb indices of trees with given number of vertices of maximum degree
- Sharp bounds of the Zagreb indices of \(k\)-trees
- Extremal multiplicative Zagreb indices among trees with given distance \(k\)-domination number
- Note on the multiplicative Zagreb indices
Cites work
- An upper bound on the sum of squares of degrees in a graph
- Independence polynomials of \(k\)-tree related graphs
- Multiplicative Zagreb indices of trees
- On acyclic simplicial complexes
- Sharp bounds for Zagreb indices of maximal outerplanar graphs
- Sharp bounds of the Zagreb indices of \(k\)-trees
- The number of labeled k-dimensional trees
Cited in
(31)- The ratio and product of the multiplicative Zagreb indices
- General multiplicative Zagreb indices of trees with given independence number
- On the multiplicative degree-based topological indices of silicon-carbon \(Si_2C_{3^-}I[p,q]\) and \(Si_{2}C_{3^-}II[p,q]\)
- On extremal multiplicative Zagreb indices of trees with given number of vertices of maximum degree
- Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter
- Maximizing and minimizing multiplicative Zagreb indices of graphs subject to given number of cut edges
- Chromatic number and some multiplicative vertex-degree-based indices of graphs
- Sharp bounds for the modified multiplicative Zagreb indices of graphs with vertex connectivity at most k
- Multiplicative Zagreb indices and coindices of some derived graphs
- Multiplicative Zagreb indices of cacti
- Extremal multiplicative Zagreb indices among trees with given distance \(k\)-domination number
- General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number
- Zagreb indices and multiplicative Zagreb indices of Eulerian graphs
- scientific article; zbMATH DE number 6940810 (Why is no real title available?)
- On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices
- The general (\(\alpha, 3\))-path connectivity indices of polycyclic aromatic hydrocarbons
- Laplacian coefficients and Zagreb indices of trees
- General multiplicative Zagreb indices of trees
- Multiplicative topological descriptors of Silicon carbide
- Distance property of chemical graphs
- Multiplicative degree based topological indices of some chemical structures in drug
- Extremal first leap Zagreb index of \(k\)-generalized quasi-trees
- scientific article; zbMATH DE number 58845 (Why is no real title available?)
- Structure properties of Koch networks based on networks dynamical systems
- On extremal multiplicative Zagreb indices of trees with given domination number
- Note on the multiplicative Zagreb indices
- On the edge-version atom-bond connectivity and geometric arithmetic indices of certain graph operations
- Sharp bounds of the hyper-Zagreb index on acyclic, unicylic, and bicyclic graphs
- On maximum signless Laplacian Estrada indices of \(k\)-trees
- On the Multiplicative Zagreb Indices of Bucket Recursive Trees
- Sharp bounds of the Zagreb indices of \(k\)-trees
This page was built for publication: Multiplicative Zagreb indices of \(k\)-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476319)
