Sigma Coloring and Edge Deletions

A vertex coloring c : V(G) → N of a non-trivial graph G is called a sigma coloring if σ(u) is not equal to σ(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...

全面介紹

Saved in:
書目詳細資料
Main Authors: Garciano, Agnes, Marcelo, Reginaldo M, Ruiz, Mari-Jo P, Tolentino, Mark Anthony C
格式: text
出版: Archīum Ateneo 2020
主題:
在線閱讀:https://archium.ateneo.edu/mathematics-faculty-pubs/149
https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1148&context=mathematics-faculty-pubs
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Ateneo De Manila University

相似書籍