Crossing numbers of Sierpiński-like graphsKlavžar, Sandi (Avtor) Mohar, Bojan (Avtor) matematikateorija grafovrisanje grafovprekrižno številografi Sierpińskegaavtomorfizmi grafovmathematicsgraf theorygraph drawingcrossing numberSierpiński graphsgraph automorphismThe crossing number of Sierpiński graphs ▫$S(n,k)$▫ and their regularizarions ▫$S^+(n,k)$▫ and ▫$S^{++}(n,k)$▫ are studied. Drawings of these graphs are presented and proved to be optimal for ▫$S^+(n,k)$▫ and ▫$S^{++}(n,k)$▫ for every ▫$n ge 1$▫ and ▫$k ge 1$▫. The crossing numbers of these graphs are expressed in terms of the crossing number of ▫$K_{k+1}$▫. These are the first nontrivial families of graphs of "fractal" type whose crossing number is known. 20052015-07-10 14:52:26Članek v reviji51505UDK: 519.173OceCobissID: 25747712COBISS_ID: 13783897ISSN pri članku: 0364-9024NUK URN: URN:SI:UM:DK:KCOIB8OJsl