Randić ordering of chemical trees
From MaRDI portal
Publication:2565859
Recommendations
- On ordering chemical trees by energy
- Ordering chemical trees by Wiener polarity index
- Extremal chemical trees with minimum or maximum general Randić index
- Ordering chemical graphs by Randić and sum-connectivity numbers
- On the Sombor index of chemical trees
- Chemical trees enumeration algorithms
- scientific article; zbMATH DE number 5656414
- Minimum general Randić index on chemical trees with given order and number of pendent vertices
- Properties of chemical trees with k pendant vertices and maximal Randić index
- scientific article; zbMATH DE number 2188382
Cites work
Cited in
(15)- On a novel connectivity index
- Chemical trees enumeration algorithms
- Ordering chemical trees by Wiener polarity index
- Extremal values of vertex-degree-based topological indices of chemical trees
- Ordering trees and graphs with few cycles by algebraic connectivity
- Zeroth-order general Randić index of cactus graphs
- Characterizing trees with large Laplacian energy
- On a method for ordering the vertices of molecular graphs
- A revised proof for one theorem of Hansen and Mélot
- Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
- Randic index and lexicographic order
- Sharp bounds on the zeroth-order general randić indices of conjugated bicyclic graphs
- Sharp bounds for Zagreb indices of maximal outerplanar graphs
- On the extremal Zagreb indices of graphs with cut edges
- On the maximum Zagreb indices of graphs with \(k\) cut vertices
This page was built for publication: Randić ordering of chemical trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2565859)