A survey and classification of Sierpiński-type graphs

详细信息    查看全文

• 作者：Andreas M. Hinz^a ; ^b ; ^d ; ^{hinz@math.lmu.de} ; Sandi Klavžar^c ; ^d ; ^b ; ^{sandi.klavzar@fmf.uni-lj.si} ; Sara Sabrina Zemljič^e ; ^b ; ^saraz@hi.is
• 关键词：Sierpiński triangle ; Sierpiński graphs ; Hanoi graphs ; Graph distance ; Domination in graphs ; Graph colorings
• 刊名：Discrete Applied Mathematics
• 出版年：2017
• 出版时间：30 January 2017
• 年：2017
• 卷：217
• 期：part_P3
• 页码：565-600
• 全文大小：951 K
• 卷排序：217

文摘

The purpose of this survey is to bring some order into the growing literature on a type of graphs which emerged in the past couple of decades under a wealth of names and in various disguises in different fields of mathematics and its applications. The central role is played by Sierpiński graphs, but we will also shed some light on variants of these graphs and in particular propose their classification. Concentrating on Sierpiński graphs proper we present results on their metric aspects, domination-type invariants with an emphasis on perfect codes, different colorings, and embeddings into other graphs.