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...
محفوظ في:
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | text |
| منشور في: |
Archīum Ateneo
2023
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://archium.ateneo.edu/mathematics-faculty-pubs/245 https://archium.ateneo.edu/context/mathematics-faculty-pubs/article/1246/viewcontent/R_MathTech22_Tolentino_Eugenio.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|