Jamel Dammak

collaborators

3 papers

math.CO2013

The $(\leq 6)$ -half-reconstructibility of digraphs

Baraa Salem, Jamel Dammak

Let $G = (V, A)$ be a digraph. With every subset $X$ of $V$ , we associate the subdigraph $G [X] = (X, A \cap (X \times X))$ of $G$ induced by $X$ . Given a positive integer $k$ , a digraph $G…

math.CO2013

On a generalization of Kelly's combinatorial lemma

Aymen Ben Amira, Jamel Dammak, Hamza Si Kaddour

Kelly's combinatorial lemma is a basic tool in the study of Ulam's reconstruction conjecture. A generalization in terms of a family of t-elements subsets of a v-element set was giv…

math.CO2006

Hypomorphy of graphs up to complementation

Jamel Dammak, Gérard Lopez, Maurice Pouzet +1

Let $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and $G^{'}$ with vertex set $V$ are {\it isomorphic up to complementation} if $G^{'}$ is isomorphic to $G$ or to t…

The (≤6)-half-reconstructibility of digraphs

On a generalization of Kelly's combinatorial lemma

Hypomorphy of graphs up to complementation

The $(\leq 6)$ -half-reconstructibility of digraphs