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: | , , |
---|---|
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 |