The Set Chromatic Numbers of the Middle Graph of Tree Families

• المؤلفون الرئيسيون: Tolentino, Mark Anthony C, Eugenio, Gerone Russel J.
• التنسيق: text
• منشور في: Archīum Ateneo 2023
• الموضوعات: middle graph; Set coloring; Mathematics; Physical Sciences and Mathematics
• الوصول للمادة أونلاين: https://archium.ateneo.edu/mathematics-faculty-pubs/245; https://archium.ateneo.edu/context/mathematics-faculty-pubs/article/1246/viewcontent/R_MathTech22_Tolentino_Eugenio.pdf

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