✦ LIBER ✦

Shortest paths in Sierpiński graphs

✍ Scribed by Xue, Bing; Zuo, Liancui; Wang, Guanghui; Li, Guojun

Book ID: 122335368
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 479 KB
Volume: 162
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.08.029

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distances in Sierpiński graphs and on th

Distances in Sierpiński graphs and on the Sierpiński gasket

✍ Cristea, Ligia L.; Steinsky, Bertran 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 443 KB

The hamiltonicity and path -coloring of

The hamiltonicity and path -coloring of Sierpiński-like graphs

✍ Bing Xue; Liancui Zuo; Guojun Li 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 445 KB

Coloring Hanoi and Sierpiński graphs

✍ Andreas M. Hinz; Daniele Parisse 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 327 KB

Contiguous Search Problem in Sierpiński

Contiguous Search Problem in Sierpiński Graphs

✍ Flaminia L. Luccio 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 509 KB

Crossing numbers of Sierpiński-like grap

Crossing numbers of Sierpiński-like graphs

✍ 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 _

The Average Eccentricity of Sierpiński G

The Average Eccentricity of Sierpiński Graphs

✍ Andreas M. Hinz, Daniele Parisse 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 254 KB