Advances and Applications in Discrete Mathematics
Volume 10, Issue 2, Pages 77 - 93
(October 2012)
|
|
SUPER - -ANTIMAGIC TOTAL LABELING OF LADDER GRAPH
L. Susilowati, T. Sania and N. Estuningsih
|
Abstract: A graph admits an -covering if every edge in G belongs to at least one of the subgraphs If for every i, is isomorphic to a given graph H, then G is called to have an H-covering. An -H-antimagic total labeling of graph G is a bijection such that the set of weights of every subgraph which is isomorphic to H is where a and d are positive integers, and t is the number of subgraph of G isomorphic to H. If then G called to have a super -H-antimagic total labeling. This project applies this labeling to the ladder graph with cover that is, and for some value of d is possible. |
Keywords and phrases: covering, total labeling, -H-antimagic total labeling, super -H-antimagic total labeling, ladder graph |
|
Number of Downloads: 260 | Number of Views: 831 |
|