TY - JOUR
ID - 13958
TI - The topological ordering of covering nodes
JO - Communications in Combinatorics and Optimization
JA - CCO
LA - en
SN - 2538-2128
AU - Shirdel, Gholam Hassan
AU - Kahkeshani, Nasrin
AD - University of Qom
Y1 - 2020
PY - 2020
VL - 5
IS - 1
SP - 55
EP - 60
KW - Directed graph
KW - Covering nodes
KW - Topological ordering algorithm
DO - 10.22049/cco.2019.26119.1077
N2 - 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.
UR - http://comb-opt.azaruniv.ac.ir/article_13958.html
L1 - http://comb-opt.azaruniv.ac.ir/article_13958_bb278a35f5e754d8fa7152e537a20961.pdf
ER -