Sigma Coloring and Edge Deletions

• المؤلفون الرئيسيون: Garciano, Agnes, Marcelo, Reginaldo M, Ruiz, Mari-Jo P, Tolentino, Mark Anthony C
• التنسيق: text
• منشور في: Archīum Ateneo 2020
• الموضوعات: sigma coloring; edge deletion; neighbor-distinguishing coloring; complement; Mathematics
• الوصول للمادة أونلاين: https://archium.ateneo.edu/mathematics-faculty-pubs/149; https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1148&context=mathematics-faculty-pubs

A vertex coloring c : V(G) → N of a non-trivial graph G is called a sigma coloring if σ(u) is not equal to σ(v) for any pair of adjacent vertices u and v. Here, σ(x) denotes the sum of the colors assigned to vertices adjacent to x. The sigma chromatic number of G, denoted by σ(G), is defined as the...