Search
Now showing items 1-9 of 9
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) ...
Stream-keys generation based on graph labeling for strengthening Vigenere encryption
(International Journal of Electrical and Computer Engineering (IJECE), 2022-08-01)
This paper address the cryptographic keys management problem: how to
generate the cryptographic keys and apply them to secure encryption. The
purpose of this research was to study on utilizing graph labeling for
generating ...
On the Local Multiset Dimension of Graph With Homogenous Pendant Edges
(Journal of Physics: Conference Series, 2019-12-01)
Let G be a connected graph with E as edge set and V as vertex set . rm(v|W) =
{d(v, s1), d(v, s2), . . . , d(v, sk)} is the multiset representation of a vertex v of G with respect to
W where d(v, si) is a distance between ...
Elegant Labeling Of Some Graphs
(Journal of Physics: Conference Series, 2020-12-01)
In this paper, we introduce a new notion of graph theory study, namely a local
edge metric dimension. It is a natural extension of metric dimension concept. dG(e, v) =
min{d(x, v), d(y, v)} is the distance between the ...
The Local (Adjacency) Metric Dimension of Split Related Complete Graph
(IOP Conf. Series: Journal of Physics: Conf. Series, 2019-04-01)
Let G be a simple graph. A set of vertices, called V (G) and a set of edges, called
E(G) are two sets which form graph G. W is a local adjacency resolving set of G if for every
two distinct vertices x, y and x adjacent ...
Elegant Labeling of Some Graphs
(Journal of Physics: Conference Series, 2020-06-19)
An elegant labeling on graph G with vertices and edges is an injective
(one-to-one) mapping from the set of vertices V (G) to the set of non-negative integers
f0; 1; 2; 3; :::; g in such a way that the set of values ...