Twins of rayless graphs

Details Twins of rayless graphs Twins of rayless graphs

2009-11-19

arxiv.org/abs/0911.3803v1

Mathematics

Combinatorics

8 pages

Scientific paper

Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of
the other. We prove that a rayless graph has either infinitely many twins or
none.

Affiliated with

Also associated with

No associations

Rating

Twins of rayless 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 Twins of rayless graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Twins of rayless graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-453441