Sigma chromatic number of graph coronas involving complete graphs
Let c : V(G) → be a coloring of the vertices in a graph G. For a vertex u in G, the color sum of u, denoted by σ(u), is the sum of the colors of the neighbors of u. The coloring c is called a sigma coloring of G if σ(u) ≠ σ(v) whenever u and v are adjacent vertices in G. The minimum number of color...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Published: |
Archīum Ateneo
2020
|
| Subjects: | |
| Online Access: | https://archium.ateneo.edu/mathematics-faculty-pubs/128 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1127&context=mathematics-faculty-pubs |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Ateneo De Manila University |