Cycle-supermagic covering on grid graph and K 1, n + K ̄ 2

T. S. Martini, M. Roswitha, Dian Lestari

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

Abstract

A simple graph G (V, E) admits an H- magic covering if every edge E belongs to subgraph of G isomorphic to H and there exists a bijection function λ: V (G) ∪ E(G) → {1,2,⋯,|V(G)|} + |E(G)|} such that for all subgraph H′ = (V′, E′) isomorphic to H and satisfying λ(H′)=defΣvλV′,f(v)+ΣeλE′,f(e)=m(f), where m(f) is constant magic sum. A graph G is an H- supermagic labeling if λ(V) = {1,2,⋯,|V(G)|} and s(f) is a constant supermagic sum. This work aim is to study C4 - supermagic covering of grid graph and C3 - supermagic covering of K1,n+K̄2.

Original languageEnglish
Title of host publicationProceedings of the 3rd International Symposium on Current Progress in Mathematics and Sciences 2017, ISCPMS 2017
EditorsRatna Yuniati, Terry Mart, Ivandini T. Anggraningrum, Djoko Triyono, Kiki A. Sugeng
PublisherAmerican Institute of Physics Inc.
ISBN (Electronic)9780735417410
DOIs
Publication statusPublished - 22 Oct 2018
Event3rd International Symposium on Current Progress in Mathematics and Sciences 2017, ISCPMS 2017 - Bali, Indonesia
Duration: 26 Jul 201727 Jul 2017

Publication series

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

Conference

Conference3rd International Symposium on Current Progress in Mathematics and Sciences 2017, ISCPMS 2017
Country/TerritoryIndonesia
CityBali
Period26/07/1727/07/17

Keywords

  • K + K̄ graph
  • cycle-supermagic covering
  • grid graph

Fingerprint

Dive into the research topics of 'Cycle-supermagic covering on grid graph and K 1, n + K ̄ 2'. Together they form a unique fingerprint.

Cite this