2014/01/18 by Anak Agung Gede Ngurah, A. A. G. Ngurah, Ngurah, A. A. G. +2
Computer Science · Mathematics · #05C78 #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #math.CO #msc:05C78
paper · pdf · doi:10.48550/arxiv.1401.4522
11 pages
openalex publication_date 2014/01/18 · arxiv created 2014/04/26 · arxiv updated 2014/04/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A graph G is called super edge-magic if there exists a bijective function f from V(G) ∪ E(G) to \1, 2, …, |V(G) ∪ E(G)|\ such that f(V(G)) = \1, 2, …, |V(G)|\ and f(x) + f(xy) + f(y) is a constant k for every edge xy of G. Furthermore, the super edge-magic deficiency of a graph G is either the minimum nonnegative integer n such that G ∪ nK1 is super edge-magic or +∞ if there exists no such integer. Join product of two graphs is their graph union with additional edges that connect all vertices of the first graph to each vertex of the second graph. In this paper, we study the super edge-magic deficiencies of a wheel minus an edge and join products of a path, a star, and a cycle, respectively, with isolated vertices.