A 2-parametric generalization of Sierpinski gasket graphs

作者：Jakovac Marko^*

来源：Ars Combinatoria, 2014, 116: 395-405.

• Sierpinski graphs
• Sierpinski gasket graphs
• Hamiltonicity
• Chromatic number

Graphs S[n,k] are introduced as the graphs obtained from the Sierpinski graphs S(n,k) by contracting edges that lie in no complete subgraph K-k. The family S[n,k] is a generalization of a previously studied class of Sierpinski gasket graphs S-n. Several properties of graphs S[n,k] are studied in particular, hamiltonicity and chromatic number.

• 出版日期2014-7