Partially Complemented Representations of Digraphs
A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. This defines an equivalence relation where two digraphs are equivalent if one can be obtained from the other by a sequence of such operations. We show that given an ad...
Main Authors: | Elias Dahlhaus, Jens Gustedt, Ross M. McConnell |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2002-12-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/172 |
Similar Items
-
Partially complemented representations of digraphs
by: Elias Dahlhaus, et al.
Published: (2002-01-01) -
The (≤5)-hypomorphy of digraphs up to complementation
by: Aymen Ben Amira, et al.
Published: (2019-01-01) -
Digraph Decompositions and Monotonocity in Digraph Searching
by: Kreutzer, S, et al.
Published: (2008) -
Digraph Decompositions and Monotonocity in Digraph Searching
by: Kreutzer, S, et al.
Published: (2008) -
Digraphs with unique annihilating polynomial : ladder digraphs /
by: 185867 Lam, Kah-Seng, et al.
Published: ([198)