The Set Chromatic Numbers of the Middle Graph of Graphs
For a simple connected graph G; let c : V (G) → N be a vertex coloring of G; where adjacent vertices may be colored the same. The neighborhood color set of a vertex v; denoted by NC(v); is the set of colors of the neighbors of v. The coloring c is called a set coloring provided that NC(u) neq NC(v)...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | text |
| 出版: |
Archīum Ateneo
2021
|
| 主題: | |
| 在線閱讀: | https://archium.ateneo.edu/mathematics-faculty-pubs/160 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1165&context=mathematics-faculty-pubs |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|