A survey and classification of Sierpiński-type graphs

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...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 217; pp. 565 - 600
Main Authors Hinz, Andreas M., Klavžar, Sandi, Zemljič, Sara Sabrina
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 30.01.2017
Elsevier BV
Subjects
Classification
Domination in graphs
Graph colorings
Graph distance
Graphs
Hanoi graphs
Mathematics
Sierpiński graphs
Sierpiński triangle
Studies
Graph distance
Sierpiński triangle
Domination in graphs
Sierpiński graphs
Graph colorings
Hanoi graphs
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2016.09.024