Multiplicative Zagreb indices of k-trees
From MaRDI portal
Publication:476319
DOI10.1016/J.DAM.2014.08.017zbMATH Open1303.05034arXiv1602.04351OpenAlexW1981984740MaRDI QIDQ476319FDOQ476319
Authors: Shaohui Wang, Bing Wei
Publication date: 28 November 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1602.04351
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
Trees (05C05) Vertex degrees (05C07) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cites Work
- Multiplicative Zagreb indices of trees
- On acyclic simplicial complexes
- The number of labeled k-dimensional trees
- An upper bound on the sum of squares of degrees in a graph
- Independence polynomials of \(k\)-tree related graphs
- Sharp bounds for Zagreb indices of maximal outerplanar graphs
- Sharp bounds of the Zagreb indices of \(k\)-trees
Cited In (31)
- The general (\(\alpha, 3\))-path connectivity indices of polycyclic aromatic hydrocarbons
- Multiplicative degree based topological indices of some chemical structures in drug
- Sharp bounds of the Zagreb indices of \(k\)-trees
- General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number
- Note on the multiplicative Zagreb indices
- On the Multiplicative Zagreb Indices of Bucket Recursive Trees
- Multiplicative Zagreb indices of cacti
- General multiplicative Zagreb indices of trees with given independence number
- General multiplicative Zagreb indices of trees
- Title not available (Why is that?)
- On the multiplicative degree-based topological indices of silicon-carbon \(Si_2C_{3^-}I[p,q]\) and \(Si_{2}C_{3^-}II[p,q]\)
- Extremal multiplicative Zagreb indices among trees with given distance \(k\)-domination number
- On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices
- Structure properties of Koch networks based on networks dynamical systems
- On the edge-version atom-bond connectivity and geometric arithmetic indices of certain graph operations
- The ratio and product of the multiplicative Zagreb indices
- 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
- Extremal first leap Zagreb index of \(k\)-generalized quasi-trees
- On extremal multiplicative Zagreb indices of trees with given domination number
- Multiplicative Zagreb indices and coindices of some derived graphs
- Distance property of chemical graphs
- Maximizing and minimizing multiplicative Zagreb indices of graphs subject to given number of cut edges
- Title not available (Why is that?)
- Sharp bounds of the hyper-Zagreb index on acyclic, unicylic, and bicyclic graphs
- Multiplicative topological descriptors of Silicon carbide
- On maximum signless Laplacian Estrada indices of \(k\)-trees
- Chromatic number and some multiplicative vertex-degree-based indices of graphs
- Zagreb indices and multiplicative Zagreb indices of Eulerian graphs
- Sharp bounds for the modified multiplicative Zagreb indices of graphs with vertex connectivity at most k
- Laplacian coefficients and Zagreb indices of 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)