Skip to main navigation Skip to search Skip to main content

On the (Pseudo) Super Edge-Magic of 2-Regular Graphs and Related Graphs

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

Abstract

Let G =(V, E) be finite and simple graphs with vertex set V(G) and edge set E(G). A graph G is called super edge-magic if there exists a bijection f: V(G) ≊ E(G) → {1, 2, ⋯, |V(G)| + |E(G)|} and f(V(G)) = {1, 2, ⋯, |V(G)|} such that f(x) + f(xy) + f(y) is a constant for every edgexy ∈ E(G). A graph G with isolated vertices is called pseudo super edge-magic if there exists a bijection f: V(G) → {1, 2, ⋯, |V(G)|} such that the set {f(x) + f(y) : Xy ∈ E(G)} ≊ {2f(x) : Deg(x) = 0} consist of |E(G)| + |{x ∈ V(G) : Deg(x) = 0}| consecutive integers. In this paper, we construct (pseudo) super edge-magic 2-regular graphs from a super edge-magic cycle by using normalized Kotzig arrays. We also show that the graph C3 ≊ Cn ≊ K1 is pseudo super edge-magic for n ≡ 1(mod 4). By this result, we obtain some new classes of super edge-magic 2-regular graphs. In addition, we show that union of cycles and paths are super edge-magic.

Original languageEnglish
Title of host publicationInternational Conference on Mathematics, Computational Sciences and Statistics 2020
EditorsCicik Alfiniyah, Fatmawati, Windarto
PublisherAmerican Institute of Physics Inc.
ISBN (Electronic)9780735440739
DOIs
Publication statusPublished - 26 Feb 2021
EventInternational Conference on Mathematics, Computational Sciences and Statistics 2020, ICoMCoS 2020 - Surabaya, Indonesia
Duration: 29 Sept 2020 → …

Publication series

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

Conference

ConferenceInternational Conference on Mathematics, Computational Sciences and Statistics 2020, ICoMCoS 2020
Country/TerritoryIndonesia
CitySurabaya
Period29/09/20 → …

Fingerprint

Dive into the research topics of 'On the (Pseudo) Super Edge-Magic of 2-Regular Graphs and Related Graphs'. Together they form a unique fingerprint.

Cite this