Degree-based topological indices: optimal trees with given number of pendents
From MaRDI portal
Publication:279189
DOI10.1016/j.amc.2014.04.081zbMath1334.05172OpenAlexW1966485324MaRDI QIDQ279189
Publication date: 27 April 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.04.081
Trees (05C05) Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (11)
Zagreb indices of transformation graphs and total transformation graphs ⋮ Extremal graphs with respect to variable sum exdeg index via majorization ⋮ Relations between distance-based and degree-based topological indices ⋮ Graphs with fixed number of pendent vertices and minimal zeroth-order general Randić index ⋮ Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees ⋮ A note on extremal trees with degree conditions ⋮ Further inequalities between vertex-degree-based topological indices ⋮ On structural properties of ABC-minimal chemical trees ⋮ Unnamed Item ⋮ Extremal augmented Zagreb index of trees with given numbers of vertices and leaves ⋮ Atom–bond connectivity index of graphs: a review over extremal results and bounds
Cites Work
- Some properties of the Narumi-Katayama index
- The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs
- Extremal Zagreb indices of graphs with a given number of cut edges
- On structure-sensitivity of degree-based topological indices
- The ABC index conundrum
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Degree-based topological indices: optimal trees with given number of pendents