The Set Chromatic Numbers of the Middle Graph of Tree Families

The neighborhood color set of each vertex v in a vertex-colored graph G is defined as the collection of the colors of all the neighbors of v. If there are no two adjacent vertices that have equal neighborhood color sets, then the coloring is called a set coloring of G. The set coloring problem on G...

全面介紹

Saved in:
書目詳細資料
Main Authors: Tolentino, Mark Anthony C, Eugenio, Gerone Russel J.
格式: text
出版: Archīum Ateneo 2023
主題:
在線閱讀:https://archium.ateneo.edu/mathematics-faculty-pubs/245
https://archium.ateneo.edu/context/mathematics-faculty-pubs/article/1246/viewcontent/R_MathTech22_Tolentino_Eugenio.pdf
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Ateneo De Manila University