$G$-reconstruction of graphs
| dc.creator | Thatte, Bhalchandra D. | |
| dc.date | 2006-08-03 | |
| dc.date.accessioned | 2026-07-07T07:21:19Z | |
| dc.date.available | 2026-07-07T07:21:19Z | |
| dc.description | Let $G$ be a group of permutations acting on an $n$-vertex set $V$, and $X$ and $Y$ be two simple graphs on $V$. We say that $X$ and $Y$ are $G$-isomorphic if $Y$ belongs to the orbit of $X$ under the action of $G$. One can naturally generalize the reconstruction problems so that when $G$ is $S_n$, the symmetric group, we have the usual reconstruction problems. In this paper, we study $G$-edge reconstructibility of graphs. We prove some old and new results on edge reconstruction and reconstruction from end vertex deleted subgraphs. | |
| dc.description | 8 pages | |
| dc.identifier | https://arxiv.org/abs/math/0608071 | |
| dc.identifier | http://arxiv.org/abs/math/0608071 | |
| dc.identifier | Ars Combinatoria 54 (2000) 293-299 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/115261 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C60 | |
| dc.title | $G$-reconstruction of graphs | |
| dc.type | text |