On the Total Set Chromatic Number of Graphs

• المؤلفون الرئيسيون: Tolentino, Mark Anthony C, Eugenio, Gerone Russel J, Ruiz, Mari-Jo P
• التنسيق: text
• منشور في: Archīum Ateneo 2022
• الموضوعات: set coloring; total graph; Mathematics; Physical Sciences and Mathematics
• الوصول للمادة أونلاين: https://archium.ateneo.edu/mathematics-faculty-pubs/216; https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1217&context=mathematics-faculty-pubs

Given a vertex coloring c of a graph, the neighborhood color set of a vertex is defined to be the set of all of its neighbors’ colors. The coloring c is called a set coloring if any two adjacent vertices have different neighborhood color sets. The set chromatic number χs(G) of a graph G is the minim...