… all those nontrivial connected graphs of order n with rainbow disconnection number k for
each k ∈ {1,2,n − 1}. The result for graphs having rainbow disconnection number 1 follows …

… a rainbow disconnection coloring of G. For a connected graph G, we similarly define the
rainbow disconnection … of colors that are needed in order to make G rainbow disconnected. A …

… G rainbow vertexdisconnected. In this paper, we characterize all graphs of order n with rainbow
vertex-disconnection number … the rainbow vertex-disconnection numbers of some special …

… rainbow vertex-disconnected. In this paper, we obtain bounds of the rainbow vertex-disconnection
number of a graph in terms of the minimum degree and maximum degree of the graph…

… G) of a graph G and the rainbow vertex-disconnection number rvd(L(G)) of the line graph L(G)
… We will show that the rainbow disconnection number of a graph G satisfying conditions (1) …

… graph G is called strong rainbow disconnected if for every two distinct vertices u and v of G,
there exists a both rainbow … -coloring is called a strong rainbow disconnection coloring (srd-…

… An edge-colored graph G is called a rainbow disconnected if for every two vertices s and t of
… an s−t rainbow cut in G. In this case, the edge-coloring c is called a rainbow disconnection …

… define the rainbow connection number of a connected graph G, … that are needed in order to
make G rainbow connected. A … graph is called a bridge if its removal disconnects the graph. …

… We study rainbow connectivity of graphs from the algorithmic and … Otherwise, the graph is
disconnected. A maximal connected subgraph of G is called a connected component (or just …

… of colors needed in a k‐rainbow coloring of G is the k‐rainbow index of G. For … ‐rainbow
index of a unicyclic graph of order n is determined. For a set S of vertices in a connected graph G …