Articles
On the Super Edge-Magic Deficiency of Graphs1

https://doi.org/10.1016/S1571-0653(04)00074-5Get rights and content

Abstract

A (p, q) graph G is edge-magic if there exists a bijective function f: V(G) ∪ E(G) → {1,2,…,p + q} such that f(u) + f(v) + f(uv) = k is a constant, called the valence of f, for any edge uv of G. Moreover, G is said to be super edge-magic if f(V(G)) = {1,2,…,p}. The question studied in this paper is for which graphs is it possible to add a finite number of isolated vertices so that the resulting graph is super edge-magic? If it is possible for a given graph G, then we say that the minimum such number of isolated vertices is the super edge-magic deficiency, μs(G) of G; otherwise we define it to be + ∞.

References (6)

  • G. Chartrand et al.

    Graphs and Digraphs

    (1986)
  • H. Enomoto et al.

    Super edge-magic graphs

    SUT Journal of Mathematics

    (1998)
There are more references available in the full text version of this article.

Cited by (0)

1

Dedicated to Professor Anna Lladó

View full text