On the sigma chromatic number of the join of a finite number of paths and cycles
Let G">GG be a simple connected graph and c:V(G)→ℕ">c:V(G)→Nc:V(G)→ℕ a coloring of the vertices in G.">G.G. For any v∈V(G)">v∈V(G)v∈V(G), let σ(v)">σ(v)σ(v) be the sum of colors of the vertices adjacent to v">vv. Then c">cc is called a sigma co...
Saved in:
Main Authors: | Garciano, Agnes, Lagura, Maria Czarina T, Marcelo, Reginaldo M |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2019
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/mathematics-faculty-pubs/72 https://www.worldscientific.com/doi/10.1142/S1793557121500194 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Ateneo De Manila University |
Similar Items
-
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) -
On the Sigma Value and Sigma Range of the Join of a Finite Number of Even Cycles of the Same Order
by: Bulay-og, Marie Cris A, et al.
Published: (2021) -
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 numbers of the middle graph of some families of graphs
by: Manamtam, Jay-R, et al.
Published: (2022)