On the set chromatic number of the join and comb product of graphs
A vertex coloring c : V(G) → of a non-trivial connected graph G is called a set coloring if NC(u) ≠ NC(v) for any pair of adjacent vertices u and v. Here, NC(x) denotes the set of colors assigned to vertices adjacent to x. The set chromatic number of G, denoted by χs (G), is defined as the fewest n...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | text |
| 出版: |
Archīum Ateneo
2020
|
| 主題: | |
| 在線閱讀: | https://archium.ateneo.edu/mathematics-faculty-pubs/124 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1123&context=mathematics-faculty-pubs |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Ateneo De Manila University |