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: | Manamtam, Jay-R, Garciano, Agnes, Tolentino, Mark Anthony C |
---|---|
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 |
Similar Items
-
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) -
Sigma Chromatic Number of the Middle Graph of Some Families of Graphs
by: Manamtam, Jay-R
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) -
The Set Chromatic Numbers of the Middle Graph of Graphs
by: Eugenio, Gerone Russel J, et al.
Published: (2021) -
The Set Chromatic Numbers of the Middle Graph of Tree Families
by: Tolentino, Mark Anthony C, et al.
Published: (2023)