Search
Now showing items 1-2 of 2
On The Packing k-Coloring of Unicyclic Graph Family
(International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 1, January – 2020, Pages: 1-9, 2020-01-09)
All graph in this paper is connected graph. Let
du,v
be a distance between any vertex
u
and
v
in graph
GV,E.
A function
c :VG 1, 2, , k
is called a packing
k coloring if every two vertex of color
i
are ...
On The Packing k-Coloring of Edge Corona Product
(International Journal of Academic and Applied Research (IJAAR), Vol. 3 Issue 12, December – 2019, Pages: 55-59, 2019-12-01)
All graph in this paper is connected and simple graph. Let
du,v
be a distance between any vertex
u
and
v
in graph
G V,E
. A function
c :VG1, 2,, k
is called a packing k-coloring if every two vertices ...