On the sigma chromatic number of the join of a finite number of paths and cycles
Let G">GG be a simple connected graph and c:V(G)→ℕ">c:V(G)→Nc:V(G)→ℕ a coloring of the vertices in G.">G.G. For any v∈V(G)">v∈V(G)v∈V(G), let σ(v)">σ(v)σ(v) be the sum of colors of the vertices adjacent to v">vv. Then c">cc is called a sigma co...
Saved in:
Main Authors: | , , |
---|---|
格式: | text |
出版: |
Archīum Ateneo
2019
|
主題: | |
在線閱讀: | https://archium.ateneo.edu/mathematics-faculty-pubs/72 https://www.worldscientific.com/doi/10.1142/S1793557121500194 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Ateneo De Manila University |