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: | , , , |
---|---|
格式: | text |
出版: |
Archīum Ateneo
2020
|
主題: | |
在線閱讀: | https://archium.ateneo.edu/mathematics-faculty-pubs/123 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1122&context=mathematics-faculty-pubs |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Ateneo De Manila University |