On the set chromatic number of the join and comb product of graphs

• المؤلفون الرئيسيون: Felipe, Bryan Ceasar L, Garciano, Agnes, Tolentino, Mark Anthony C
• التنسيق: text
• منشور في: Archīum Ateneo 2020
• الموضوعات: Mathematics
• الوصول للمادة أونلاين: https://archium.ateneo.edu/mathematics-faculty-pubs/124; https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1123&context=mathematics-faculty-pubs
• المؤسسة: Ateneo De Manila University

A vertex coloring c : V(G) → of a non-trivial connected graph G is called a set coloring if NC(u) ≠ NC(v) for any pair of adjacent vertices u and v. Here, NC(x) denotes the set of colors assigned to vertices adjacent to x. The set chromatic number of G, denoted by χs (G), is defined as the fewest n...