The $(\leq 6)$-half-reconstructibility of digraphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2013
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929256857075712 |
|---|---|
| author | Salem, Baraa Dammak, Jamel |
| author_facet | Salem, Baraa Dammak, Jamel |
| contents | 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$ is $(\leq k)$-half-reconstructible if it is determined up to duality by its subdigraphs of cardinality $\leq k$. In 2003, J. Dammak characterized the $(\leq k)$-half-reconstructible finite digraphs, for $k\in \{7,8,9,10,11\}$. N. El Amri, extended J. Dammak's characterization to infinite digraphs. In this paper, we characterize the $(\leq 6)$-half-reconstructible infinite digraphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1311_1765 |
| institution | arXiv |
| publishDate | 2013 |
| record_format | arxiv |
| spellingShingle | The $(\leq 6)$-half-reconstructibility of digraphs Salem, Baraa Dammak, Jamel Combinatorics 05C60 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$ is $(\leq k)$-half-reconstructible if it is determined up to duality by its subdigraphs of cardinality $\leq k$. In 2003, J. Dammak characterized the $(\leq k)$-half-reconstructible finite digraphs, for $k\in \{7,8,9,10,11\}$. N. El Amri, extended J. Dammak's characterization to infinite digraphs. In this paper, we characterize the $(\leq 6)$-half-reconstructible infinite digraphs. |
| title | The $(\leq 6)$-half-reconstructibility of digraphs |
| topic | Combinatorics 05C60 |
| url | https://arxiv.org/abs/1311.1765 |