$G$-reconstruction of graphs

Details $G$-reconstruction of graphs $G$-reconstruction of graphs

2006-08-03

arxiv.org/abs/math/0608071v1

Ars Combinatoria 54 (2000) 293-299

Mathematics

Combinatorics

8 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

$G$-reconstruction of graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with $G$-reconstruction of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and $G$-reconstruction of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-50784