The Sigma Chromatic Number of the Circulant Graphs Cn(1,2) , Cn(1,3) , and C2n(1,n)

• Main Authors: Ruiz, Mari-Jo P, Luzon, Paul Adrian D, Tolentino, Mark Anthony C
• Format: text
• Published: Archīum Ateneo 2016
• Subjects: Neighbor-distinguishing coloring; Sigma coloring; Circulant graphs; Other Mathematics
• Online Access: https://archium.ateneo.edu/mathematics-faculty-pubs/76; https://link.springer.com/chapter/10.1007/978-3-319-48532-4_19
• Institution: Ateneo De Manila University

For a non-trivial connected graph G, let c:V(G)→N" role="presentation" style="box-sizing: border-box; display: inline-table; line-height: normal; letter-spacing: normal; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none...