Article ID Journal Published Year Pages File Type
4650055 Discrete Mathematics 2009 9 Pages PDF
Abstract

Vertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs SnSn, the Sierpiński graphs S(n,k)S(n,k), graphs S+(n,k)S+(n,k), and graphs S++(n,k)S++(n,k) are considered. In particular, χ″(Sn)χ″(Sn), χ′(S(n,k))χ′(S(n,k)), χ(S+(n,k))χ(S+(n,k)), χ(S++(n,k))χ(S++(n,k)), χ′(S+(n,k))χ′(S+(n,k)), and χ′(S++(n,k))χ′(S++(n,k)) are determined.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Vertex-, edge-, and total-colorings of Sierpiński-like graphs
Authors
, ,