Maximally edge-connected graphs and Zeroth-order general Randić index for 0<α<10<α<1

Let GG be a connected graph with order n=|V(G)|n=|V(G)|, minimum degree δ=δ(G)δ=δ(G) and edge-connectivity λ=λ(G)λ=λ(G). A graph is said to be maximally edge-connected if λ=δλ=δ. In this paper, we present two sufficient conditions for (triangle-free) graphs to be maximally edge-connected in terms of its order and the Zeroth-order general Randić index.