Abstract
The list coloring of a graph G = G(V, E) is to color each vertex v ∈ V (G) from its color set L(v). If any two adjacent vertices have different colors, then G is properly colored. The aim of this paper is to study the list coloring of some graph operations
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have