On the Sigma Value and Sigma Range of the Join of a Finite Number of Even Cycles of the Same Order
Let c be a vertex coloring of a simple; connected graph G that uses positive integers for colors. For a vertex v of G; the color sum of v is the sum of the colors of the neighbors of v. If no two adjacent vertices of G have the same color sum; then c is called a sigma coloring of G. The sigma chroma...
Saved in:
Main Authors: | Bulay-og, Marie Cris A, Garciano, Agnes, Marcelo, Reginaldo M |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2021
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/mathematics-faculty-pubs/159 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1166&context=mathematics-faculty-pubs |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Ateneo De Manila University |
Similar Items
-
On the sigma chromatic number of the join of a finite number of paths and cycles
by: Garciano, Agnes, et al.
Published: (2019) -
On the Sigma Chromatic Number of the Zero-Divisor Graphs of the Ring of Integers Modulo n
by: Garciano, Agnes, et al.
Published: (2021) -
Sigma Chromatic Number of the Middle Graph of Some Families of Graphs
by: Manamtam, Jay-R
Published: (2021) -
Sigma Chromatic Number of the Middle Graph of Some General Families of Trees of Height 2
by: Manamtam, Jay R.A., et al.
Published: (2023) -
Sigma chromatic numbers of the middle graph of some families of graphs
by: Manamtam, Jay-R, et al.
Published: (2022)