Search
Now showing items 1-7 of 7
P2 ▷ H-super antimagic total labeling of comb product of graphs
(2018-04-12)
Let L and H be two simple, nontrivial and undirected graphs. Let o be a vertex of H, the comb product between L and H,
denoted by L ▷ H, is a graph obtained by taking one copy of L and |V(L)| copies of H and grafting the ...
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 ...
Super (a*, d*)-H-antimagic total covering of second order of shackle graphs
(2018-02-28)
Let H be a simple and connected graph. A shackle of graph H, denoted by
G = shack(H; v; n), is a graph G constructed by non-trivial graphs H
such
that, for every 1 · s; t · n, H
have no a common vertex with js ¡ tj ¸ ...
A Super (A,D)-Bm-Antimagic Total Covering Of Ageneralized Amalgamation Of Fan Graphs
(2018-02-28)
We assume finite, simple and undirected graphs in this study. Let G, H be two graphs. By an (a,d)-H-
antimagic total graph, we mean any obtained bijective function 𝑓 ∶ 𝑉
(
𝐺
)
∪ 𝐸
(
𝐺
)
→ {1, 2, 3, … ...
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, ...
The Construction of P2⊳H- antimagic graph using smaller edge - antimagic vertex labeling
(2018-07-04)
In this paper we use simple and non trivial graph. If there exist a
bijective function g : V (G) [ E(G) ! f1; 2; : : : ; jV (G)j + jE(G)jg, such that for all
subgraphs P
2
B H of G isomorphic to H, then graph G is ...
Super (a, d)-Cycles-Antimagic Labeling of Subdivision of a Fan Graph
(2018-12-21)
We consider a simple, connected and undirected graph ( )EVG , with
vertex set
()GV and edge set ( ).GE There is a super ( ) H-, da -
antimagic total labeling on the graph ( )EVG , if there exists
a ...