Title of article :
The topological ordering of covering nodes
Author/Authors :
Shirdel, G.H Department of Mathematics - Faculty of Basic Sciences - University of Qom, Qom, I.R. Iran , Kahkeshani, N Department of Mathematics - Faculty of Basic Sciences - University of Qom, Qom, I.R. Iran
Abstract :
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 ordering algorithm on graphs containing the covering nodes. We show that
there exists a cut set with forward arcs in these graphs and the order of the covering
nodes is successive.
Keywords :
topological ordering algorithm , covering nodes , Directed graph
Journal title :
Communications in Combinatorics and Optimization
