Crossing numbers of Sierpiński‐like graphs
Sandi Klavžar, Bojan Mohar · Journal of Graph Theory · 2005
Abstract Crossing numbers of Sierpiński graphs S(n,k) and their regularizations 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 ≥ 1 and k ≥ 1. The crossing numbers of these graphs are expressed in terms of the crossing number of Kk+1. These are the first nontrivial families of graphs of “fractal” type whose crossing number is known. © 2005 Wiley Periodicals, Inc. J Graph Theory