The sigma chromatic number of the Sierpinski gasket graphs and the Hanoi graphs
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 fewes...
Saved in:
Main Authors: | , , , |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2020
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/mathematics-faculty-pubs/123 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1122&context=mathematics-faculty-pubs |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Ateneo De Manila University |
id |
ph-ateneo-arc.mathematics-faculty-pubs-1122 |
---|---|
record_format |
eprints |
spelling |
ph-ateneo-arc.mathematics-faculty-pubs-11222020-07-10T06:31:04Z The sigma chromatic number of the Sierpinski gasket graphs and the Hanoi graphs Garciano, Agnes Marcelo, Reginaldo M Ruiz, Mari-Jo P Tolentino, Mark Anthony C 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. 2020-01-01T08:00:00Z text application/pdf https://archium.ateneo.edu/mathematics-faculty-pubs/123 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1122&context=mathematics-faculty-pubs Mathematics Faculty Publications Archīum Ateneo Mathematics |
institution |
Ateneo De Manila University |
building |
Ateneo De Manila University Library |
country |
Philippines |
collection |
archium.Ateneo Institutional Repository |
topic |
Mathematics |
spellingShingle |
Mathematics Garciano, Agnes Marcelo, Reginaldo M Ruiz, Mari-Jo P Tolentino, Mark Anthony C The sigma chromatic number of the Sierpinski gasket graphs and the Hanoi graphs |
description |
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. |
format |
text |
author |
Garciano, Agnes Marcelo, Reginaldo M Ruiz, Mari-Jo P Tolentino, Mark Anthony C |
author_facet |
Garciano, Agnes Marcelo, Reginaldo M Ruiz, Mari-Jo P Tolentino, Mark Anthony C |
author_sort |
Garciano, Agnes |
title |
The sigma chromatic number of the Sierpinski gasket graphs and the Hanoi graphs |
title_short |
The sigma chromatic number of the Sierpinski gasket graphs and the Hanoi graphs |
title_full |
The sigma chromatic number of the Sierpinski gasket graphs and the Hanoi graphs |
title_fullStr |
The sigma chromatic number of the Sierpinski gasket graphs and the Hanoi graphs |
title_full_unstemmed |
The sigma chromatic number of the Sierpinski gasket graphs and the Hanoi graphs |
title_sort |
sigma chromatic number of the sierpinski gasket graphs and the hanoi graphs |
publisher |
Archīum Ateneo |
publishDate |
2020 |
url |
https://archium.ateneo.edu/mathematics-faculty-pubs/123 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1122&context=mathematics-faculty-pubs |
_version_ |
1681506744594857984 |