The following pages link to Randić ordering of chemical trees (Q2565859):
Displaying 14 items.
- Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number (Q410007) (← links)
- Sharp bounds on the zeroth-order general randić indices of conjugated bicyclic graphs (Q636488) (← links)
- Sharp bounds for Zagreb indices of maximal outerplanar graphs (Q719030) (← links)
- On the extremal Zagreb indices of graphs with cut edges (Q970473) (← links)
- On the maximum Zagreb indices of graphs with \(k\) cut vertices (Q982233) (← links)
- On a novel connectivity index (Q1037518) (← links)
- Chemical trees enumeration algorithms (Q1429293) (← links)
- Ordering chemical trees by Wiener polarity index (Q1740052) (← links)
- Extremal values of vertex-degree-based topological indices of chemical trees (Q2180716) (← links)
- Ordering trees and graphs with few cycles by algebraic connectivity (Q2250940) (← links)
- Zeroth-order general Randić index of cactus graphs (Q2293835) (← links)
- Characterizing trees with large Laplacian energy (Q2437344) (← links)
- On a method for ordering the vertices of molecular graphs (Q2715465) (← links)
- Randic index and lexicographic order (Q5934314) (← links)