A survey and classification of Sierpinski-type graphs

被引：64

作者：

Hinz, Andreas M. ^{[1
,2
,4
]}

Klavzar, Sandi ^{[2
,3
,4
]}

Zemljic, Sara Sabrina ^{[2
,5
]}

机构：

[1] Ludwig Maximilians Univ Munchen, Math Inst, Munich, Germany

[2] Inst Math Phys & Mech, Ljubljana, Slovenia

[3] Univ Ljubljana, Fac Math & Phys, Ljubljana 61000, Slovenia

[4] Univ Maribor, Fac Nat Sci & Math, Maribor, Slovenia

[5] Univ Iceland, Inst Sci, Reykjavik, Iceland

来源：

DISCRETE APPLIED MATHEMATICS | 2017年 / 217卷

关键词：

Sierpinski triangle; Sierpinski graphs; Hanoi graphs; Graph distance; Domination in graphs; Graph colorings; B-CHROMATIC NUMBER; GENERALIZED POWER DOMINATION; WK-RECURSIVE NETWORK; SHORTEST PATHS; METRIC PROPERTIES; PERFECT CODES; HANOI; TOWER; EDGE; HAMILTONICITY;

D O I：

10.1016/j.dam.2016.09.024

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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 Sierpinski graphs, but we will also shed some light on variants of these graphs and in particular propose their classification. Concentrating on Sierpinski 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. (C) 2016 Elsevier B.V. All rights reserved.

引用

页码：565 / 600

页数：36

共 119 条

[1]

Alekseyev M.A., 2016, MATH VARIOUS ENTERTA, P65

[2] Investigating the b-chromatic number of bipartite graphs by using the bicomplement [J].