Rainbow Eulerian multidigraphs and the product of cycles

From MaRDI portal
Publication:2808538

zbMATH Open1336.05051arXiv1403.7649MaRDI QIDQ2808538FDOQ2808538

S. C. López, F. A. Muntaner-Batle

Publication date: 24 May 2016

Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

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 FinGamma. Consider any function h:E(D)longrightarrowGamma. Then the product DotimeshGamma is the digraph with vertex set V(D)imesV and ((a,x),(b,y))inE(DotimeshGamma) if and only if (a,b)inE(D) and (x,y)inE(h(a,b)). In this paper we use rainbow eulerian multidigraphs and permutations as a way to characterize the otimesh-product of oriented cycles. We study the behavior of the otimesh-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.


Full work available at URL: https://arxiv.org/abs/1403.7649




Recommendations





Cited In (1)





This page was built for publication: Rainbow Eulerian multidigraphs and the product of cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808538)