Multiplicative Zagreb indices of \(k\)-trees
From MaRDI portal
Publication:476319
DOI10.1016/j.dam.2014.08.017zbMath1303.05034arXiv1602.04351OpenAlexW1981984740MaRDI QIDQ476319
Publication date: 28 November 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.04351
Trees (05C05) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex degrees (05C07)
Related Items (24)
General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number ⋮ Maximizing and minimizing multiplicative Zagreb indices of graphs subject to given number of cut edges ⋮ Sharp bounds of the hyper-Zagreb index on acyclic, unicylic, and bicyclic graphs ⋮ General multiplicative Zagreb indices of trees ⋮ On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices ⋮ Note on the multiplicative Zagreb indices ⋮ Multiplicative topological descriptors of Silicon carbide ⋮ Zagreb indices and multiplicative Zagreb indices of Eulerian graphs ⋮ The general (\(\alpha, 3\))-path connectivity indices of polycyclic aromatic hydrocarbons ⋮ On the edge-version atom-bond connectivity and geometric arithmetic indices of certain graph operations ⋮ Structure properties of Koch networks based on networks dynamical systems ⋮ On maximum signless Laplacian Estrada indices of \(k\)-trees ⋮ Multiplicative Zagreb indices and coindices of some derived graphs ⋮ The Ratio and Product of the Multiplicative Zagreb Indices ⋮ Multiplicative Zagreb indices of cacti ⋮ General multiplicative Zagreb indices of trees with given independence number ⋮ Extremal multiplicative Zagreb indices among trees with given distance k-domination number ⋮ On extremal multiplicative Zagreb indices of trees with given domination 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]\)] ⋮ Unnamed Item ⋮ Sharp bounds for the modified multiplicative Zagreb indices of graphs with vertex connectivity at most k ⋮ Multiplicative degree based topological indices of some chemical structures in drug ⋮ Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter ⋮ On extremal multiplicative Zagreb indices of trees with given number of vertices of maximum degree
Cites Work
- Unnamed Item
- Sharp bounds for Zagreb indices of maximal outerplanar graphs
- Independence polynomials of \(k\)-tree related graphs
- An upper bound on the sum of squares of degrees in a graph
- Sharp bounds of the Zagreb indices of \(k\)-trees
- On acyclic simplicial complexes
- The number of labeled k-dimensional trees
This page was built for publication: Multiplicative Zagreb indices of \(k\)-trees