The distinguishing number of the iterated line graph

Details The distinguishing number of the iterated line graph The distinguishing number of the iterated line graph

2005-09-14

arxiv.org/abs/math/0509296v1

Mathematics

Combinatorics

10 pages, 2 figures

Scientific paper

We show that for all simple graphs G other than the cycles C_3,C_4,C_5, and
the claw K_1,3 there exists a K > 0 such that whenever k > K the k-th iterate
of the line graph can be distinguished by at most two colors. Additionally we
determine, for trees, when the distinguishing number of the line graph of T is
greater than the distinguishing number of T.

Affiliated with

Also associated with

No associations

Rating

The distinguishing number of the iterated line graph 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 The distinguishing number of the iterated line graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The distinguishing number of the iterated line graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-680437