Sigma Coloring and Edge Deletions
A vertex coloring c : V(G) → N of a non-trivial graph G is called a sigma coloring if σ(u) is not equal to σ(v) for any pair of adjacent vertices u and v. Here, σ(x) denotes the sum of the colors assigned to vertices adjacent to x. The sigma chromatic number of G, denoted by σ(G), is defined as the...
Saved in:
Main Authors: | Garciano, Agnes, Marcelo, Reginaldo M, Ruiz, Mari-Jo P, Tolentino, Mark Anthony C |
---|---|
格式: | text |
出版: |
Archīum Ateneo
2020
|
主題: | |
在線閱讀: | https://archium.ateneo.edu/mathematics-faculty-pubs/149 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1148&context=mathematics-faculty-pubs |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Ateneo De Manila University |
相似書籍
-
The Sigma Chromatic Number of the Circulant Graphs Cn(1,2) , Cn(1,3) , and C2n(1,n)
由: Ruiz, Mari-Jo P, et al.
出版: (2016) -
On the Sigma Chromatic Number of the Zero-Divisor Graphs of the Ring of Integers Modulo n
由: Garciano, Agnes, et al.
出版: (2021) -
On twin edge colorings in m-ary trees
由: Tolentino, Jayson D, et al.
出版: (2022) -
On the Sigma Value and Sigma Range of the Join of a Finite Number of Even Cycles of the Same Order
由: Bulay-og, Marie Cris A, et al.
出版: (2021) -
On the Set Chromatic Number of the Middle Graph of Extended Stars and Related Tree Families
由: Tolentino, Mark Anthony C, et al.
出版: (2023)