The Set Chromatic Numbers of the Middle Graph of Graphs

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

For a simple connected graph G; let c : V (G) → N be a vertex coloring of G; where adjacent vertices may be colored the same. The neighborhood color set of a vertex v; denoted by NC(v); is the set of colors of the neighbors of v. The coloring c is called a set coloring provided that NC(u) neq NC(v)...