On the Set Chromatic Number of the Middle Graph of Extended Stars and Related Tree Families
Suppose G is a simple, undirected, finite, nontrivial, and connected graph and that c: V (G) → N is a vertex coloring, not necessarily proper, of G. As introduced by Chartrand et al., c is called a set coloring of G if NC(u) ≠ NC(v) for every pair of adjacent vertices u and v; here, NC(x) denotes th...
Saved in:
Main Authors: | , |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2023
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/mathematics-faculty-pubs/246 https://thaijmath2.in.cmu.ac.th/index.php/thaijmath/article/view/1549/1512 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Ateneo De Manila University |
Be the first to leave a comment!