Degree-based topological indices: optimal trees with given number of pendents
From MaRDI portal
Recommendations
- Minimizing degree-based topological indices for trees with given number of pendent vertices
- The smallest ABC index of trees with n pendent vertices
- Vertex-degree-based topological indices over trees with two branching vertices
- Extremal values of vertex-degree-based topological indices of chemical trees
- The path and the star as extremal values of vertex-degree-based topological indices among trees
Cites work
- Comparing the multiplicative Zagreb indices
- Extremal Zagreb indices of graphs with a given number of cut edges
- scientific article; zbMATH DE number 1330692 (Why is no real title available?)
- scientific article; zbMATH DE number 2121251 (Why is no real title available?)
- scientific article; zbMATH DE number 2239308 (Why is no real title available?)
- Minimizing degree-based topological indices for trees with given number of pendent vertices
- Multiplicative Zagreb indices of trees
- On structure-sensitivity of degree-based topological indices
- Some properties of the Narumi-Katayama index
- The ABC index conundrum
- The degree-product index of Narumi and Katayama
- The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs
Cited in
(13)- Extremal graphs with respect to variable sum exdeg index via majorization
- Further inequalities between vertex-degree-based topological indices
- A note on extremal trees with degree conditions
- Extremal augmented Zagreb index of trees with given numbers of vertices and leaves
- Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees
- On structural properties of ABC-minimal chemical trees
- Minimizing degree-based topological indices for trees with given number of pendent vertices
- Zagreb indices of transformation graphs and total transformation graphs
- Graphs with fixed number of pendent vertices and minimal first Zagreb index
- Atom–bond connectivity index of graphs: a review over extremal results and bounds
- Relations between distance-based and degree-based topological indices
- Graphs with fixed number of pendent vertices and minimal zeroth-order general Randić index
- Comparative study on sombor and elliptic sombor indices for trees and unicyclic graphs with fixed number of leaves
This page was built for publication: Degree-based topological indices: optimal trees with given number of pendents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q279189)