The ( 5)-hypomorphy of digraphs up to complementation

DOI10.1016/J.AJMSC.2018.06.002zbMATH Open1413.05133OpenAlexW2809971476MaRDI QIDQ1713868FDOQ1713868

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

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

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

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Hypomorphy of graphs up to complementation
• On hypergraphs of girth five
• On the nonexistence of almost Moore digraphs of degree four and five
• scientific article; zbMATH DE number 1933254
• On the \(\{4,-k\}\)-hypomorphy for digraphs.
• The recognition of the class of indecomposable digraphs under low hemimorphy
• scientific article; zbMATH DE number 4041961
• scientific article; zbMATH DE number 1334617
• The homomorphism threshold of \({C_3, C_5}\)-free graphs
• A \(C_5\)-decomposition of the \(\lambda\)-fold line graph of the complete graph

Cites work

• scientific article; zbMATH DE number 458873 (Why is no real title available?)
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 17789 (Why is no real title available?)
• scientific article; zbMATH DE number 6930600 (Why is no real title available?)
• scientific article; zbMATH DE number 3375499 (Why is no real title available?)
• scientific article; zbMATH DE number 3394133 (Why is no real title available?)
• Boolean sum of graphs and reconstruction up to complementation
• Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem
• Graph reconstruction—a survey
• Graphs indecomposable with respect to the X-join
• Hereditary hemimorphy of \(\{-k\}\)-hemimorphic tournaments for \(k \geq 5\)
• Hypomorphy of graphs up to complementation
• L'Indeformabilite des Relations et Multirelations Binaires
• La relation différence et l'anti‐isomorphie
• Minimal indecomposable graphs
• Orders and (\(\leq 4\))-hemimorphy
• Rélations non reconstructibles par leurs restrictions
• Strongly self-complementary and hereditarily isomorphic tournaments
• The falsity of the reconstruction conjecture for tournaments
• Transitiv orientierbare Graphen

Cited in

(7)

• On the \(\{4,-k\}\)-hypomorphy for digraphs.
• Are all pairs of hypomorphic digraphs \(S\)-isomorphic?
• Hereditary hemimorphy of \(\{ 5,-4\}\)-hemimorphic arc connected digraphs.
• An isomorphism theorem for digraphs
• Boolean sum of graphs and reconstruction up to complementation
• Hypomorphy of graphs up to complementation
• Morphology of the connected components of the Boolean sum of two digraphs \((\le 5)\)-hypomorphic up to complementation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1713868)