The following pages link to On the connectivity index of trees (Q937643):
Displaying 16 items.
- Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number (Q410007) (← links)
- Sharp bounds for the Zagreb indices of bicyclic graphs with \(k\)-pendant vertices (Q608279) (← links)
- Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter (Q609972) (← links)
- On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\) (Q710976) (← 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)
- Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges (Q1037523) (← links)
- Higher order connectivity index of starlike trees (Q1613355) (← links)
- Extremal results for directed tree connectivity (Q2117576) (← links)
- The starlike trees with maximum and minimum second order connectivity index (Q2511081) (← links)
- (Q3798673) (← links)
- (Q4352948) (← links)
- (Q4899831) (← links)
- On the sum-connectivity index of trees (Q5049830) (← links)
- On the Connectivity of Token Graphs of Trees (Q6045414) (← links)
