Grid-magic labelings of grid unions

F. F. Hadiputra, V. Vito, K. A. Sugeng, D. R. Silaban, T. K. Maryati

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Consider G and H as simple graphs. A graph G has an H-covering if every edge of G belongs to a subgraph of G which the subgraph is isomorphic to H. The graph G is said to be H-magic if there exists a total labeling of G such that for every subgraph H′ of G where H′ is isomorphic to H, then the sum of all labels in H′ is constant. In this paper, we study grid-like graphs G, whose faces in F(G) are labeled. The magic labeling of type (1,1,1) means that the label is assigned to all vertices, edges, and faces, and the weight is calculated as -v-V(G) l(v)+-e-E(G) l(e)+-f-F(G) l(f) with all weight for every face being constant. We show that certain unions of grid graphs are H-magic, where H is a grid graph.

Original languageEnglish
Title of host publicationProceedings of the 5th International Symposium on Current Progress in Mathematics and Sciences, ISCPMS 2019
EditorsTerry Mart, Djoko Triyono, Tribidasari Anggraningrum Ivandini
PublisherAmerican Institute of Physics Inc.
ISBN (Electronic)9780735420014
DOIs
Publication statusPublished - 1 Jun 2020
Event5th International Symposium on Current Progress in Mathematics and Sciences, ISCPMS 2019 - Depok, Indonesia
Duration: 9 Jul 201910 Jul 2019

Publication series

NameAIP Conference Proceedings
Volume2242
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616

Conference

Conference5th International Symposium on Current Progress in Mathematics and Sciences, ISCPMS 2019
Country/TerritoryIndonesia
CityDepok
Period9/07/1910/07/19

Keywords

  • grid magic labelings
  • H-covering
  • H-magic graph
  • H-magic labeling

Fingerprint

Dive into the research topics of 'Grid-magic labelings of grid unions'. Together they form a unique fingerprint.

Cite this