Search
Now showing items 1-4 of 4
On r-Dynamic Chromatic Number of the Corronation of Path and Several Graphs
(International Journal of Advanced Engineering Research and Science (IJAERS), [Vol-4, Issue-4, Apr- 2017], 2017-04-09)
This study is a natural extension of k -proper
coloring of any simple and connected graph G. By a n rdynamic
coloring of a graph G, we mean a proper k coloring
of
graph
G
such
that
the
neighbors
of
any
vert ...
Vertex Coloring Edge-Weighting of Coronation by Path Graphs
(IOP Conf. Series: Journal of Physics: Conf. Series 1211 (2019) 012004, 2019-05-07)
In this paper, we study vertex coloring edge of corona graph. A k-edge weigting of
graph G is mapping w : (EG) ! f1; 2; ; kg. An edge-weighting w induces a vertex coloring
Fw : V (G) ! N de ned by fw(v) =
P
v2e
w(e). ...
Local Antimagic r-dynamic Coloring of Graphs
(IOP Conf. Series: Earth and Environmental Science 243 (2019) 012077, 2019-04-09)
Let G = (V; E) be a connected graph. A bijection function f : E(G) !
f1; 2; 3; ; E(G)jg is called a local antimagic labeling if for all uv 2 E(G)s, w(u)
6= w(v),
where w(u) = e2E(u)f(e). Such that, local antimagic ...
On the Chromatic Number Local Irregularity of Related Wheel Graph
(IOP Conf. Series: Journal of Physics: Conf. Series 1211 (2019) 012003, 2019-05-07)
A function f is called a local irregularity vertex coloring if (i) l : V (G) !
f1; 2; ; kg as vertex irregular k-labeling and w : V (G) ! N, for every uv 2 E(G); w(u)
6= w(v)
where w(u) = v2N(u)l(v) and (ii) ...