Now showing items 1-9 of 9

• #### A new labeling construction from the ⊗h-product ﻿

(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 ...
• #### A problem on edge-magic labelings of cycles ﻿

(Cambridge University Press, 2014-06-14)
Kotzig and Rosa defined in 1970 the concept of edge-magic labelings as follows: let G be a simple (p, q)-graph (that is, a graph of order p and size q without loops or multiple edges). A bijective function f : V (G)∪E(G) ...
• #### (Di)graph products, labelings and related results ﻿

(Elsevier, 2017)
Gallian's survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them. Moreover, due to the freedom of one of the factors, we can ...
• #### Labeling constructions using digraph products ﻿

(Elsevier, 2013)
In this paper we study the edge-magicness of graphs with equal size and order, and we use such graphs and digraph products in order to construct labelings of different classes and of different graphs. We also study super ...
• #### New constructions for the n-queens problem ﻿

(Springer, 2020-02)
Let D be a digraph, possibly with loops. A queen labeling of D is a bijective function l:V(G)⟶{1,2,…,|V(G)|} such that, for every pair of arcs in E(D), namely (u, v) and (u′,v′) we have (i) l(u)+l(v)≠l(u′)+l(v′) and (ii) ...
• #### On super edge-magic decomposable graphs ﻿

(Springer, 2012)
Let G be any graph and let {Hi}i∈I be a family of graphs such that E(Hi) ∩ E(Hj ) = ∅ when i 6= j, ∪i∈IE(Hi) = E(G) and E(Hi) 6= ∅ for all i ∈ I. In this paper we introduce the concept of {Hi}i∈I -super edge-magic decomposable ...
• #### Rainbow eulerian multidigraphs and the product of cycles ﻿

(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 Figueroa-Centeno ...
• #### The jumping knight and other (super) edge-magic constructions ﻿

(Springer, 2014)
Let G be a graph of order p and size q with loops allowed. A bijective function f:V(G)∪E(G)→{i}p+qi=1 is an edge-magic labeling of G if the sum f(u)+f(uv)+f(v)=k is independent of the choice of the edge uv. The constant k ...
• #### The power of digraph products applied to labelings ﻿

(Elsevier, 2012)
The ⊗h-product was introduced in 2008 by Figueroa-Centeno et al. as a way to construct new families of (super) edge-magic graphs and to prove that some of those families admit an exponential number of (super) edge-magic ...