Search
Now showing items 1-10 of 12
Local Edge Antimagic Coloring of Comb Product of Graphs
(2018-07-03)
All graph in this paper are ¯nite, simple and connected graph. Let
G(V; E) be a graph of vertex set V and edge set E. A bijection f : V (G) ¡!
f1; 2; 3; :::; jV (G)jg is called a local edge antimagic labeling if for any ...
On the rainbow coloring for some graph operations
(2018-02-28)
Let G = (V, E) be a nontrivial, finite, simple and undirected connected graph on which is defined a coloring f : E(G) → {1,2, …, k}, k ∈ N. The adjacent edges may be colored the same colors. A path in an edge colored graph ...
LOCAL EDGE ANTIMAGIC COLORING OF GRAPHS
(2018-02-28)
All graphs considered in this paper are finite, simple and connected graphs. Let G(V, E) be a graph with the vertex set V and the edge set E, and let w be the edge weight of graph G. Then a bijection f: V (G) → {1, 2, 3, ...
Super local edge antimagic total coloring of Pn . H
(2018-07-04)
In this paper, we consider that all graphs are ¯nite, simple and connected.
Let G(V; E) be a graph of vertex set V and edge set E. A bijection f : V (G) ¡!
f1; 2; 3; :::; jV (G)jg is called a local edge antimagic labeling ...
On the locating domination number of corona product
(2018-07-04)
Let G =(V (G),E(G) be a connected graph and v V (G). A dominating set for a
graph G =(V, E) is a subset D of V such that every vertex not in D is adjacent to at least one
member of D. The domination number γ(G) is the ...
On The Local Metric Dimension of Line Graph of Special Graph
(2018-02-28)
Let G be a simple, nontrivial, and connected graph. 𝑊 = {𝑤
} is a representation of an ordered
set of k distinct vertices in a nontrivial connected graph G. The metric code of a vertex v, where 𝑣 ∈ G, the
ordered ...
The non-isolated resolving number of k-corona product of graphs
(2018-07-04)
Let all graphs be a connected and simple graph. A set W = fw
g
of veretx set of G, the kvector ordered r(vjW) = (d(x; w
1
); d(x; w
2
1
; w
2
); : : : ; d(x; w
)) of is a
representation of v with respect to W, ...
On the local edge antimagicness of m-splitting graphs
(2018-07-03)
Let G be a connected and simple graph. A split graph is a graph derived by adding
new vertex v
0
in every vertex v such that v
0
adjacent to v in graph G. An m-splitting graph
is a graph which has m v
0
-vertices, ...
On the total rainbow connection of the wheel related graphs
(2018-07-04)
Let G = (V (G); E(G)) be a nontrivial connected graph with an edge coloring
c : E(G) ! f1; 2; :::; lg; l 2 N, with the condition that the adjacent edges may be colored by
the same colors. A path P in G is called rainbow ...
On Super Local Antimagic Total Edge Coloring of Some Wheel Related Graphs
(2018-10-29)
Let G be a connected graph, let V(G) be the vertex set of graph G, and let
E(G) be the edge set of graph G. Thus, the
bijective function f : V(G) ∪ E(G) −→ {1, 2, 3, ..., |V(G)| + |E(G)|} is called a local antimagic ...