The reversing number of a diagraph

AbstractA minimum reversing set of a diagraph is a smallest sized set of arcs which when reversed makes the diagraph acyclic. We investigate a related issue: Given an acyclic diagraph D, what is the size of a smallest tournament T which has the arc set of D as a minimun reversing set? We show that such a T always exists and define the reversing number of an acyclic diagraph to be the number of vertices in T minus the number of vertices in D. We also derive bounds and exact values of the reversing number for certain classes of acyclic diagraphs

T_r-span of directed wheel graphs

In this paper, we consider T-colorings of directed graphs. In particular, we consider as a T-set the set Tr = {0, 1, 2, . . ., r−1, r+1, . . .}. Exact values and bounds of the Tr-span of directed graphs whose underlying graph is a wheel graph are presented

T_r -Span of Directed Wheel Graphs

In this paper, we consider T-colorings of directed graphs. In particular, we consider as a T-set the set Tr = {0, 1, 2, . . ., r−1, r+1, . . .}. Exact values and bounds of the Tr-span of directed graphs whose underlying graph is a wheel graph are presented

The reversing number of a digraph

SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : RP 10932 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc