# Rainbow eulerian multidigraphs and the product of cycles

Abstract : 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 et al. as follows: let $D$ be a digraph and let $\Gamma$ be a family of digraphs such that $V(F)=V$ for every $F\in \Gamma$. Consider any function $h:E(D) \longrightarrow \Gamma$. Then the product $D \otimes_h \Gamma$ is the digraph with vertex set $V(D) \times V$ and $((a,x),(b,y)) \in E(D \otimes_h \Gamma)$ if and only if $(a,b) \in E(D)$ and $(x,y) \in E(h (a,b))$. In this paper we use rainbow eulerian multidigraphs and permutations as a way to characterize the $\otimes_h$-product of oriented cycles. We study the behavior of the $\otimes_h$-product when applied to digraphs with unicyclic components. The results obtained allow us to get edge-magic labelings of graphs formed by the union of unicyclic components and with different magic sums.
Keywords :
Document type :
Journal articles

Cited literature [17 references]

https://hal.inria.fr/hal-01352847
Contributor : Coordination Episciences Iam <>
Submitted on : Tuesday, August 16, 2016 - 5:00:04 PM
Last modification on : Monday, November 16, 2020 - 3:56:03 PM
Long-term archiving on: : Thursday, November 17, 2016 - 10:40:04 AM

### File

2731-9907-1-PB.pdf
Explicit agreement for this submission

### Identifiers

• HAL Id : hal-01352847, version 1

### Citation

Susana López, Francesc-Antoni Muntaner-Batle. Rainbow eulerian multidigraphs and the product of cycles. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2016, Vol. 17 no. 3 (3), pp.90-104. ⟨hal-01352847⟩

Record views