𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Contiguous Search Problem in Sierpiński Graphs

✍ Scribed by Flaminia L. Luccio

Book ID
105915017
Publisher
Springer
Year
2008
Tongue
English
Weight
509 KB
Volume
44
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 Hub Number of Sierpiński-Like Graphs
The Hub Number of Sierpiński-Like Graphs
✍ Chien-Hung Lin; Jia-Jie Liu; Yue-Li Wang; William Chung-Kung Yen 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 647 KB