… are connected acyclic digraphs with reversing number 0 for n ~ 7. A parameter d(n, r) giving
the size of the largest arc set of an acyclic digraph on n vertices with reversing number r is …

… between the domination number of the simple 2-regular digraphs and their reverse can be
… simple 3-regular digraphs with the same property for the total domination number. We shall …

… digraph D, we seek a smallest sized tournament T that has D as a minimum feedback arc
set. The reversing number of a digraph … the reversing number for all digraphs consisting of a …

… of dichromatic number of a digraph which is a generalization of the chromatic number of
a … , it follows that the digraphs Pr U Pi form the required set of C,-subdigraphs of D - (u, v). …

… discrete dynamical systems in digraphs consisting in reversing cycles, cocycles… (reversing
sinks) by considering all orientations (reversing cocycles) and by introducing duality (reversing …

… Consider TrX T*, where Tr=({1,2 ..... r}, {(i,j)ll <~i<j<~r}) is the transitive tournament with r
vertices and 7~ is a tournament which we get from Tr by reversing the arc (1, r). It can be …

… We study a digraph version of this operation, called push. Pushing a vertex in a digraph …
We say that a digraph D can be pushed to a digraph H if a digraph isomorphic to H can be …

… for graphs, we define the Ramsey number r(D l , D 2 ) of two digraphs D 1 and D 2 as …
digraph of order p) contains a monochromatic D 1 or D 2 . It is shown(Theorem 1) that this number …

… of digraphs having Seymour vertices. Motivated by this ongoing research, in this thesis, we
study on digraphs in … In this paper, we call a directed tree a reversed rooted directed tree if it is …

… interesting property: The digraph G−1 obtained from G by reversing the direction of … digraph
G−1 the reverse of G. In the Cayley digraph setting, the reverse of G = C(Γ,X) is the digraph G…