For any real number α, the sum of the α-th powers of the degrees of a (molecular) graph G,
denoted by 0Rα (G), is known as the general zeroth–order Randic index as well as the …

Define the zeroth-order Randić index as R^0(G)=∑_x∈V(G)1d_G(x), where d_G(x) denotes
the degree of the vertex x. In this paper, we present two sufficient conditions for graphs and …

The connectivity of a graph is a fundamental property of a graph. Connectivity is a portrayal
of the degree of connectivity of a diagram. The level of connectivity of a graph is an important …

Define the zeroth-order Randić index R^ 0 (G)= ∑ _ x ∈ V (G) 1 d_G (x) R 0 (G)=∑ x∈ V
(G) 1 d G (x), where d_G (x) d G (x) denotes the degree of the vertex x. In this paper, we …

Let G be a connected graph with order n, minimum degree δ= δ (G) and edge-connectivity
λ= λ (G). A graph G is maximally edge-connected if λ= δ, and super edge-connected if every …

设 G=(V, E) 是一个连通图. 边集 S E, 如果 GS 不连通且 GS 的每个连通分支至少有 2 个点,
则称 S 是一个限制性边割. 限制性边连通度 λ′(G) 就是 G 的最小限制性边割的基数 …