%0 Journal Article
%T The topological ordering of covering nodes
%J Communications in Combinatorics and Optimization
%I Azarbaijan Shahid Madani University
%Z 2538-2128
%A Shirdel, Gholam Hassan
%A Kahkeshani, Nasrin
%D 2020
%\ 06/01/2020
%V 5
%N 1
%P 55-60
%! The topological ordering of covering nodes
%K Directed graph
%K Covering nodes
%K Topological ordering algorithm
%R 10.22049/cco.2019.26119.1077
%X The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these graphs and the order of the covering nodes is successive.
%U http://comb-opt.azaruniv.ac.ir/article_13958_bb278a35f5e754d8fa7152e537a20961.pdf