Search
Now showing items 1-2 of 2
Local Irregular Vertex Coloring of Some Families Graph
(Journal of Discrete Mathematical Sciences and Cryptography, (DOI : 10.1080/09720529.2020.1754541), 2020-06-09)
All graph in this paper is connected and simple graph. Let d(u, v) be a distance between
any vertex u and v in graph G = (V, E ). A function : ( )
l V G
{1, 2,
, }
k
→
is called vertex irregular
k-labelling ...
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) ...