The distinguishing number of the iterated line graph

Simple item page
dc.creatorShipman, Ian
dc.date2005-09-14
dc.date.accessioned2026-07-07T05:23:10Z
dc.date.available2026-07-07T05:23:10Z
dc.descriptionWe 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.
dc.description10 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0509296
dc.identifierhttp://arxiv.org/abs/math/0509296
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/76331
dc.subjectCombinatorics
dc.subject05C15 (Primary) 05C75, 05C25 (Secondary)
dc.titleThe distinguishing number of the iterated line graph
dc.typetext

Files

Collections

arXiv