Dominating cycle of directed graph
Zhi Yin · 2002
The author studies dominating cycle of directed graph with the method of studying dominating cycle of undirected graph, and proves that: Let D be a strongly connected simple graph of order n(n ≥7),for any arc( x,y ) of D ,if d -(x)+d +(y)n -4,then D contains a dominating cycle.