On the Set Chromatic Number of the Middle Graph of Extended Stars and Related Tree Families

Suppose G is a simple, undirected, finite, nontrivial, and connected graph and that c: V (G) → N is a vertex coloring, not necessarily proper, of G. As introduced by Chartrand et al., c is called a set coloring of G if NC(u) ≠ NC(v) for every pair of adjacent vertices u and v; here, NC(x) denotes th...

全面介紹

Saved in:
書目詳細資料
Main Authors: Tolentino, Mark Anthony C, Eugenio, Gerone Russel J
格式: text
出版: Archīum Ateneo 2023
主題:
在線閱讀:https://archium.ateneo.edu/mathematics-faculty-pubs/246
https://thaijmath2.in.cmu.ac.th/index.php/thaijmath/article/view/1549/1512
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Ateneo De Manila University