NOVA. The University of Newcastle's Digital Repository

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/932529

Title

On H-supermagic labelings for certain shackles and amalgamations of a connected graph

Author/Creator

Maryati, T. K.;  Salman, A. N. M.;  Baskoro, E. T.;  Ryan, J. F.;  Miller, M.

Institution

The University of Newcastle. Faculty of Engineering & Built Environment, School of Electrical Engineering and Computer Science

Description

Let H be a graph. A graph G = (V,E) is said to be H-magic if every edge of G belongs to at least one subgraph isomorphic to H and there is a total labeling f:V ⋃ E → {1,2, . . . ,|V|+ |E|} such that for each subgraph H' = (V',E') of G isomorphic to H, the sum of all vertex labels in V' plus the sum of all edge labels in E' is a fixed constant. Additionally, G is said to be H-supermagic if f(V) = {1,2, .. . , |V|}. We study H-supermagic labelings of some graphs obtained from k isomorphic copies of a connected graph H. By using a k-balanced partition of multisets, we prove that certain shackles and amalgamations of a connected graph H are H-supermagic.

Relation

Utilitas Mathematica Vol. 83, p. 333-342

Relation

http://utilitasmathematica.org

Date

2010

Publisher

Utilitas Mathematica Publishing

Keyword(s)

H-covering;  H-supermagic labeling;  k-balanced;  edge-magic

Resource Type

journal article

Identifier

http://hdl.handle.net/1959.13/932529

Identifier

ISSN:0315-3681

---

Reviewed

Save/E-mail Citation

Citation Format

Plain Text Citation HTML Citation EndNote Format

E-mail Address

Subject

"Utilitas Mathematica"

 

OR