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

• المؤلفون الرئيسيون: Tolentino, Mark Anthony C, Eugenio, Gerone Russel J
• التنسيق: text
• منشور في: Archīum Ateneo 2023
• الموضوعات: middle graph; neighbor-distinguishing coloring; set coloring; trees; Mathematics; Physical Sciences and Mathematics
• الوصول للمادة أونلاين: 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

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...