Let D be a digraph with vertex set V(D) .For vertex vV(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient conditions for digraphs to be maximally edge-connected in terms of the zeroth-order general Randic index, the order and the minimum degree when Using the associated digraph of a graph, we show that our results include some corresponding known results on graphs.
Volkmann, L. (2016). Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs. Communications in Combinatorics and Optimization, 1(1), 1-13. doi: 10.22049/cco.2016.13514
MLA
L. Volkmann. "Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs". Communications in Combinatorics and Optimization, 1, 1, 2016, 1-13. doi: 10.22049/cco.2016.13514
HARVARD
Volkmann, L. (2016). 'Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs', Communications in Combinatorics and Optimization, 1(1), pp. 1-13. doi: 10.22049/cco.2016.13514
VANCOUVER
Volkmann, L. Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs. Communications in Combinatorics and Optimization, 2016; 1(1): 1-13. doi: 10.22049/cco.2016.13514
)