Sigma chromatic numbers of the middle graph of some families of graphs

• المؤلفون الرئيسيون: Manamtam, Jay-R, Garciano, Agnes, Tolentino, Mark Anthony C
• التنسيق: text
• منشور في: Archīum Ateneo 2022
• الموضوعات: sigma coloring; middle graph; Mathematics; Physical Sciences and Mathematics
• الوصول للمادة أونلاين: https://archium.ateneo.edu/mathematics-faculty-pubs/218; https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1219&context=mathematics-faculty-pubs

Let G be a nontrivial connected graph and let c : V (G) → be a vertex coloring of G, where adjacent vertices may have the same color. For a vertex υ of G, the color sum σ(υ) of υ is the sum of the colors of the vertices adjacent to υ. The coloring c is said to be a sigma coloring of G if σ(u) ≠ σ(υ...