Sigma chromatic numbers of the middle graph of some families of graphs
Let G be a nontrivial connected graph and let c : V (G) → be a vertex coloring of G, where adjacent vertices may have the same color. For a vertex υ of G, the color sum σ(υ) of υ is the sum of the colors of the vertices adjacent to υ. The coloring c is said to be a sigma coloring of G if σ(u) ≠ σ(υ...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2022
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/mathematics-faculty-pubs/218 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1219&context=mathematics-faculty-pubs |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Ateneo De Manila University |