P2▹H-super antimagic total labeling of comb product of graphs
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 ith copy of H at the vertex o to the ith vertex of L. By definition of comb produc...
Main Authors: | Ika Hesti Agustin, R.M. Prihandini, Dafik |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2019-08-01
|
Series: | AKCE International Journal of Graphs and Combinatorics |
Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860017300695 |
Similar Items
-
-super antimagic total labeling of comb product of graphs
by: Ika Hesti Agustin, et al.
Published: (2019-08-01) -
Implementation of super H-antimagic total graph on establishing stream cipher
by: Antonius Cahya Prihandoko, et al.
Published: (2019-06-01) -
Local Super Antimagic Total Labeling for Vertex Coloring of Graphs
by: Slamin Slamin, et al.
Published: (2020-11-01) -
Super (a, d)-Edge Antimagic Total Labeling of Connected Ferris Wheel Graph
by: Djoni Budi Sumarno, et al.
Published: (2015-04-01) -
Super (a, d)-H-antimagic labeling of subdivided graphs
by: Taimur Amir, et al.
Published: (2018-06-01)