Author:
Garciano A D,Marcelo R M,Ruiz M J P,Tolentino M A C
Abstract
Abstract
A vertex coloring c : V(G) → ℕ of a non-trivial connected graph G is called a sigma coloring if σ(u) ≠ σ(v) for any pair of adjacent vertices u and v. Here, σ(x) denotes the sum of the colors assigned to vertices adjacent to x. The sigma chromatic number of G, denoted by σ(G), is defined as the fewest number of colors needed to construct a sigma coloring of G. In this paper, we determine the sigma chromatic numbers of the Sierpiński gasket graphs and the Hanoi graphs. Moreover, we prove the uniqueness of the sigma coloring for Sierpiński gasket graphs.
Subject
General Physics and Astronomy
Reference13 articles.
1. On the lucky choice number of graphs;Akbari;Graphs and Combinatorics,2013
2. Coloring and counting on the tower of Hanoi graphs;Arett;Mathematics Magazine,2010
3. The set chromatic number of a graph;Chartrand;Discussiones Mathematicae Graph Theory,2009
4. The sigma chromatic number of a graph;Chartrand;Graphs and Combinatorics,2010
5. Lucky labelings of graphs;Czerwiński;Information Processing Letters,2009