For a graph G(V,E), an edge-covering of G is a family of different subgraphs H1,…Hk such that any edge of E belongs to at least one of the subgraphs Hi, 1 ≤ i ≤ k. If every Hi is isomorphic to a given graph H, then G admits an H-covering. Graph G is said to be H-magic if G has an H-covering and there is a total labeling such that for each subgraph H′ = (V′,E′) of G isomorphic to H, is fixed constant. Furthermore, if then G is called H-supermagic. The sum of all vertex and edge labels on H, under a labeling f, is denoted by Σf(H). In this paper we study H-supermagic labeling for some classes of trees such as a double star, a caterpillar, a firecracker and a banana tree.
Topics
Bioacoustics of insects
This content is only available via PDF.
© 2012 American Institute of Physics.
2012
American Institute of Physics
You do not currently have access to this content.