The Set Chromatic Numbers of the Middle Graph of Tree Families

The neighborhood color set of each vertex v in a vertex-colored graph G is defined as the collection of the colors of all the neighbors of v. If there are no two adjacent vertices that have equal neighborhood color sets, then the coloring is called a set coloring of G. The set coloring problem on G...

Full description

Saved in:
Bibliographic Details
Main Authors: Tolentino, Mark Anthony C, Eugenio, Gerone Russel J.
Format: text
Published: Archīum Ateneo 2023
Subjects:
Online Access:https://archium.ateneo.edu/mathematics-faculty-pubs/245
https://archium.ateneo.edu/context/mathematics-faculty-pubs/article/1246/viewcontent/R_MathTech22_Tolentino_Eugenio.pdf
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