Search
Now showing items 1-1 of 1
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 ...