The Set Chromatic Numbers of the Middle Graph of Graphs

For a simple connected graph G; let c : V (G) → N be a vertex coloring of G; where adjacent vertices may be colored the same. The neighborhood color set of a vertex v; denoted by NC(v); is the set of colors of the neighbors of v. The coloring c is called a set coloring provided that NC(u) neq NC(v)...

Full description

Saved in:
Bibliographic Details
Main Authors: Eugenio, Gerone Russel J, Ruiz, Mari-Jo P, Tolentino, Mark Anthony C
Format: text
Published: Archīum Ateneo 2021
Subjects:
Online Access:https://archium.ateneo.edu/mathematics-faculty-pubs/160
https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1165&context=mathematics-faculty-pubs
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Ateneo De Manila University
Be the first to leave a comment!
You must be logged in first