TY - JOUR
ID - 13514
TI - Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
JO - Communications in Combinatorics and Optimization
JA - CCO
LA - en
SN - 2538-2128
AU - Volkmann, Lutz
AD - RWTH Aachen University
Y1 - 2016
PY - 2016
VL - 1
IS - 1
SP - 1
EP - 13
KW - Digraphs
KW - edge-connectivity
KW - Maximally edge-connected digraphs
KW - Zeroth-order general Randic index
DO - 10.22049/cco.2016.13514
N2 - Let $D$ be a finite and simple digraph with vertex set $V(D)$. For a vertex $v\in V(D)$, the degree of $v$, denoted by $d(v)$, is defined as the minimum value of its out-degree $d^+(v)$ and its in-degree $d^-(v)$. Now let $D$ be a digraph with minimum degree $\delta\ge 1$ and edge-connectivity $\lambda$. If $\alpha$ is real number, then, analogously to graphs, we define the zeroth-order general Randi\'{c} index by $\sum_{x\in V(D)}(d(x))^{\alpha}$. A digraph is maximally edge-connected if $\lambda=\delta$. In this paper, we present sufficient conditions for digraphs to be maximally edge-connected in terms of the zeroth-order general Randi\'{c} index, the order and the minimum degree when $\alpha <0$, $0<\alpha <1$ or $1<\alpha\le 2$. Using the associated digraph of a graph, we show that our results include some corresponding known results on graphs.
UR - https://comb-opt.azaruniv.ac.ir/article_13514.html
L1 - https://comb-opt.azaruniv.ac.ir/article_13514_2c29013911bbc87b1dc4be81c6823349.pdf
ER -