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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites Work

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

Cited In (4)

• Boolean sum of graphs and reconstruction up to complementation
• Morphology of the connected components of the Boolean sum of two digraphs \((\le 5)\)-hypomorphic up to complementation
• Hypomorphy of graphs up to complementation
• An isomorphism theorem for digraphs

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)