Sigma chromatic numbers of the middle graph of some families of graphs

Let G be a nontrivial connected graph and let c : V (G) → be a vertex coloring of G, where adjacent vertices may have the same color. For a vertex υ of G, the color sum σ(υ) of υ is the sum of the colors of the vertices adjacent to υ. The coloring c is said to be a sigma coloring of G if σ(u) ≠ σ(υ...

全面介紹

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