The \((\leq 5)\)-hypomorphy of digraphs up to complementation

DOI10.1016/J.AJMSC.2018.06.002zbMath1413.05133OpenAlexW2809971476MaRDI QIDQ1713868

Aymen Ben Amira, Jamel Dammak, Hamza Si Kaddour, Bechir Chaari

Publication date: 30 January 2019

Published in: Arab Journal of Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ajmsc.2018.06.002

zbMATH Keywords

digraphisomorphismtournamentindecomposabilitysymmetric digraphBoolean sum\(k\)-hypomorphy up to complementationhereditary isomorphy up to complementation

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Rélations non reconstructibles par leurs restrictions
• Strongly self-complementary and hereditarily isomorphic tournaments
• Minimal indecomposable graphs
• Graphs indecomposable with respect to the X-join
• Hypomorphy of graphs up to complementation
• Boolean sum of graphs and reconstruction up to complementation
• HEREDITARY HEMIMORPHY OF {-κ}-HEMIMORPHIC TOURNAMENTS FOR ≥ 5
• The falsity of the reconstruction conjecture for tournaments
• Graph reconstruction—a survey
• L'Indeformabilite des Relations et Multirelations Binaires
• La relation différence et l'anti‐isomorphie
• Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem
• Transitiv orientierbare Graphen
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The \((\leq 5)\)-hypomorphy of digraphs up to complementation