$G$-reconstruction of graphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-50784

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.