The (≤5)-hypomorphy of digraphs up to complementation
Two digraphs G=(V,E)and G′=(V,E′)are isomorphic up to complementation if G′is isomorphic to G or to the complement G¯≔(V,{(x,y)∈V2:x≠y,(x,y)∉E})of G. The Boolean sum G+̇G′is the symmetric digraph U=(V,E(U))defined by {x,y}∈E(U)if and only if (x,y)∈E and (x,y)∉E′, or (x,y)∉E and (x,y)∈E′. Let k be a...
Main Authors: | Aymen Ben Amira, Bechir Chaari, Jamel Dammak, Hamza Si Kaddour |
---|---|
Format: | Article |
Language: | English |
Published: |
Emerald Publishing
2019-01-01
|
Series: | Arab Journal of Mathematical Sciences |
Online Access: | http://www.sciencedirect.com/science/article/pii/S1319516617301871 |
Similar Items
-
On the number of edges of a graph and its complement
by: Jamel Dammak, et al.
Published: (2021-04-01) -
Partially complemented representations of digraphs
by: Elias Dahlhaus, et al.
Published: (2002-01-01) -
Partially Complemented Representations of Digraphs
by: Elias Dahlhaus, et al.
Published: (2002-12-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)