The following pages link to (Q3655071):
Displaying 13 items.
- Sharp bounds of the zeroth-order general Randić index of bicyclic graphs with given pendent vertices (Q629365) (← links)
- Sums of powers of the degrees of graphs with \(k\) cut edges (Q659742) (← links)
- The asymptotic value of the zeroth-order Randić index and sum-connectivity index for trees (Q669447) (← links)
- Graphs with fixed number of pendent vertices and minimal zeroth-order general Randić index (Q670829) (← links)
- Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index (Q881585) (← links)
- More on ``Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index'' (Q967340) (← links)
- Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\) (Q1617001) (← links)
- Bounds for degree-based network entropies (Q1664287) (← links)
- Maximal value of the zeroth-order Randić index (Q1811080) (← links)
- Extremal \((n,n + 1)\)-graphs with respected to zeroth-order general Randić index (Q2468696) (← links)
- Conjugated tricyclic graphs with the maximum zeroth-order general Randić index (Q2511080) (← links)
- The zeroth-order general Randic index of graphs with a given clique number (Q5151991) (← links)
- (n,m)-Graphs with Maximum Vertex–Degree Function–Index for Convex Functions (Q6182463) (← links)
