Search
Now showing items 1-2 of 2
On r-dynamic vertex coloring of some flower graph families
(World Scientific Publishing Company, 2021-03-03)
e a simple, connected undirected graph with m vertices and n edges. Let ver tex coloring c of a graph G be a mapping c : V (G) → S, where |S| = k and it is k-colorable. Vertex coloring is proper if none of the any two ...
On the local irregularity vertex coloring of volcano, broom, parachute, double broom and complete multipartite graphs
(World Scientific Publishing Company, 2021-09-05)
Let G = (V,E) be a simple, finite, undirected, and connected graph with vertex set V (G) and edge set E(G). A bijection l : V (G) → {1, 2,...,k} is label function l if opt(l) = min{max(li) : li vertex irregular labeling} ...