Loading...
Loading...

Go to the content (press return)

Perfect (super) Edge-Magic Crowns

Author
López, S.C.; Muntaner-Batle, F.A.; Prabu, M.
Type of activity
Journal article
Journal
Results in mathematics
Date of publication
2017-01-06
First page
1
Last page
13
DOI
https://doi.org/10.1007/s00025-016-0643-7 Open in new window
Repository
http://hdl.handle.net/2117/103956 Open in new window
https://arxiv.org/abs/1602.01337 Open in new window
URL
http://link.springer.com/article/10.1007%2Fs00025-016-0643-7 Open in new window
Abstract
A graph G is called edge-magic if there is a bijective function f from the set of vertices and edges to the set {1,2,…,|V(G)|+|E(G)|} such that the sum f(x)+f(xy)+f(y) for any xy in E(G) is constant. Such a function is called an edge-magic labelling of G and the constant is called the valence. An edge-magic labelling with the extra property that f(V(G))={1,2,…,|V(G)|} is called super edge-magic. A graph is called perfect (super) edge-magic if all theoretical (super) edge-magic valences are p...
Citation
López, S.C., Muntaner-Batle, F.A., Prabu, M. Perfect (super) Edge-Magic Crowns. "Results in mathematics", 6 Gener 2017, p. 1-13.
Keywords
Edge-magic, Perfect (super) edge-magic, Super edge-magic, Valence
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

  • López Masip, Susana Clara  (author)
  • Muntaner Batle, Francesc Antoni  (author)
  • Prabu, M.  (author)

Attachments