Search
Now showing items 1-2 of 2
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} ...
An Inclusive Local Irregularity Coloring of Graphs
(Advances in Mathematics: Scientific Journal, 2020)
All graph in this paper are connected and simple. Let G = (V, E) be a simple graph, where V (G) is vertex set and E(G) is edge set. The local irregularity vertex coloring of G is l : V (G) → {1, 2, · · · , k} and w : V (G) ...