Supermagic coverings of the disjoint union of graphs and amalgamations

DOI10.1016/j.disc.2012.11.005zbMath1259.05148OpenAlexW2125028433MaRDI QIDQ1937551

T. K. Maryati, A. N. M. Salman, Edy Tri Baskoro

Publication date: 1 March 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.11.005

zbMATH Keywords

\(H\)-covering\(H\)-supermagic labeling\((k\(H\)-magic labeling\theta )\)-balanced

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (12)

Super \((a, d)\)-\(H\)-antimagic labeling of subdivided graphs ⋮ Stacked book graphs are cycle-antimagic ⋮ Super \(H\)-antimagic total covering for generalized antiprism and toroidal octagonal map ⋮ Two constructions of \(H\)-antimagic graphs ⋮ On (F, H)-simultaneously-magic labelings of graphs ⋮ \(H\)-coverings of path-amalgamated ladders and fans ⋮ ON -ANTIMAGICNESS OF DISCONNECTED GRAPHS ⋮ On $H$-antimagicness of Cartesian product of graphs ⋮ Ladders and fan graphs are cycle-antimagic ⋮ ON CYCLE-SUPERMAGICNESS OF SUBDIVIDED GRAPHS ⋮ OnH-antimagic decomposition of toroidal grids and triangulations ⋮ On magic and consecutive antimagic factorizations of graphs

This page was built for publication: Supermagic coverings of the disjoint union of graphs and amalgamations