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 |
---|---|
格式: | text |
出版: |
Archīum Ateneo
2021
|
主題: | |
在線閱讀: | https://archium.ateneo.edu/mathematics-faculty-pubs/159 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1166&context=mathematics-faculty-pubs |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
On the sigma chromatic number of the join of a finite number of paths and cycles
由: Garciano, Agnes, et al.
出版: (2019) -
On the Sigma Chromatic Number of the Zero-Divisor Graphs of the Ring of Integers Modulo n
由: Garciano, Agnes, et al.
出版: (2021) -
Sigma Chromatic Number of the Middle Graph of Some Families of Graphs
由: Manamtam, Jay-R
出版: (2021) -
Sigma Chromatic Number of the Middle Graph of Some General Families of Trees of Height 2
由: Manamtam, Jay R.A., et al.
出版: (2023) -
Sigma chromatic numbers of the middle graph of some families of graphs
由: Manamtam, Jay-R, et al.
出版: (2022)