Perfect (super) EdgeMagic Crowns
View/Open
Issue date
2017Suggested citation
López Masip, SusanaClara;
Muntaner Batle, F. A.;
Prabu, M.;
.
(2017)
.
Perfect (super) EdgeMagic Crowns.
Results in Mathematics, 2017, vol. 71, num. 34, p. 14591471.
https://doi.org/10.1007/s0002501606437.
Metadata
Show full item recordAbstract
A graph G is called edgemagic 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 edgemagic labelling of G and the constant is called the valence. An edgemagic
labelling with the extra property that f(V(G))={1,2, ,V(G)} is called super edgemagic. A graph is called perfect (super) edgemagic if all theoretical (super) edgemagic valences are possible. In this paper we continue the study of the valences for (super) edgemagic labelings of crowns Cm⊙K¯¯¯¯¯n and we prove that the crowns are perfect (super) edgemagic when m=pq where p and q are different odd primes. We also provide a lower bound for the number of different valences of Cm⊙K¯¯¯¯¯n , in terms of the prime factors of m.
Is part of
Results in Mathematics, 2017, vol. 71, num. 34, p. 14591471European research projects
Collections
Related items
Showing items related by title, author, creator and subject.

A new labeling construction from the ⊗hproduct
López Masip, SusanaClara; Muntaner Batle, F. A.; Prabu, M. (Elsevier, 2017)The product that is referred in the title was introduced in 2008 as a generalization of the Kronecker product of digraphs. Many relations among labelings have been obtained since then, always using as a second factor a ... 
New problems related to the valences of (super) edgemagic labelings
López Masip, SusanaClara; Muntaner Batle, F. A.; Rius Font, Miquel (2013)A graph G of order p and size q is edgemagic if there is a bijective function f : V (G) ∪ E(G) −→ {i} p+q i=1 such that f(x) + f(xy) + f(y) = k , for all xy ∈ E(G) . The function f is an edgemagic labeling of G and the ... 
Rainbow eulerian multidigraphs and the product of cycles
López Masip, SusanaClara; Muntaner Batle, F. A. (DMTCS, 2016)An arc colored eulerian multidigraph with $l$ colors is rainbow eulerian if there is an eulerian circuit in which a sequence of $l$ colors repeats. The digraph product that refers the title was introduced by FigueroaCenteno ...