The ( 6)-half-reconstructibility of digraphs

DOI10.1016/J.CRMA.2014.03.009MaRDI QIDQ404400zbMATH OpenOpenAlexFDO

Authors Jamel Dammak, Baraa Salem

Publication date 4 September 2014

Published in Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1311.1765

zbMATH Keywords

oriented graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Abstract: Let $G=(V,A)$ be a digraph. With every subset $X$ of $V$, we associate the subdigraph $G[X]=(X,Acap(XimesX))$ of $G$ induced by $X$. Given a positive integer $k$, a digraph $G$ is $(leqk)$-half-reconstructible if it is determined up to duality by its subdigraphs of cardinality $leqk$. In 2003, J. Dammak characterized the $(leqk)$-half-reconstructible finite digraphs, for $kin7,8,9,10,11$. N. El Amri, extended J. Dammak's characterization to infinite digraphs. In this paper, we characterize the $(leq6)$-half-reconstructible infinite digraphs.

Recommendations

• The (\(\leqslant k\))-half-reconstructibility of graphs for \(k\in \{11,12\}\)
• The \((\leq k)\)-half-reconstructability of graphs for \(7\leq k\leq 12\).
• Sufficient conditions for the \(N\)-reconstructibility of all digraphs
• ( k)-half-reconstructible tournaments for k 6
• scientific article; zbMATH DE number 1136782
• scientific article; zbMATH DE number 5287238
• The six bidecomposable graphs
• scientific article; zbMATH DE number 4023330
• The 6-girth-thickness of the complete graph
• On Reconstructing Graphs and Their Complements

Cites work

• scientific article; zbMATH DE number 458873 (Why is no real title available?)
• scientific article; zbMATH DE number 4039949 (Why is no real title available?)
• scientific article; zbMATH DE number 17789 (Why is no real title available?)
• scientific article; zbMATH DE number 3334164 (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?)
• Graph reconstruction—a survey
• Hereditary hemimorphy of \(\{-k\}\)-hemimorphic tournaments for \(k \geq 5\)
• Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments
• La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
• La dualité dans la demi-reconstruction des relations binaires finies
• La relation différence et l'anti‐isomorphie
• Prechains and self duality
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
• Sur la (-k)-demi-reconstructibilité des tournois finis
• The minimal non-\((\leqslant k)\)-reconstructible relations
• ( k)-half-reconstructible tournaments for k 6

Cited in

(4)

• The (\(\leqslant k\))-half-reconstructibility of graphs for \(k\in \{11,12\}\)
• ( k)-half-reconstructible tournaments for k 6
• \((\leq k)\)-hereditarily reconstructible digraphs
• The \((\leq k)\)-half-reconstructability of graphs for \(7\leq k\leq 12\).

This page was built for publication: The \((\leq 6)\)-half-reconstructibility of digraphs

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