Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
Sigma Chromatic Numbers Of The Middle Graph Of Some Families Of Graphs, Jay-R Manamtam, Agnes Garciano, Mark Anthony C. Tolentino
Sigma Chromatic Numbers Of The Middle Graph Of Some Families Of Graphs, Jay-R Manamtam, Agnes Garciano, Mark Anthony C. Tolentino
Mathematics Faculty Publications
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) ≠ σ(υ) whenever u and υ are adjacent vertices in G. The minimum number of colors that can be …