Crossing numbers of Sierpiński-like grap
✍
Sandi Klavžar; Bojan Mohar
📂
Article
📅
2005
🏛
John Wiley and Sons
🌐
English
⚖ 161 KB
## 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 _