Sigma chromatic number of graph coronas involving complete graphs

• المؤلفون الرئيسيون: Garciano, Agnes, Lagura, Maria Czarina T, Marcelo, Reginaldo M
• التنسيق: text
• منشور في: Archīum Ateneo 2020
• الموضوعات: Mathematics
• الوصول للمادة أونلاين: https://archium.ateneo.edu/mathematics-faculty-pubs/128; https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1127&context=mathematics-faculty-pubs

Let c : V(G) → be a coloring of the vertices in a graph G. For a vertex u in G, the color sum of u, denoted by σ(u), is the sum of the colors of the neighbors of u. The coloring c is called a sigma coloring of G if σ(u) ≠ σ(v) whenever u and v are adjacent vertices in G. The minimum number of color...