Rainbow Eulerian multidigraphs and the product of cycles
From MaRDI portal
Publication:2808538
Abstract: An arc colored eulerian multidigraph with colors is rainbow eulerian if there is an eulerian circuit in which a sequence of colors repeats. The digraph product that refers the title was introduced by Figueroa-Centeno et al. as follows: let be a digraph and let be a family of digraphs such that for every . Consider any function . Then the product is the digraph with vertex set and if and only if and . In this paper we use rainbow eulerian multidigraphs and permutations as a way to characterize the -product of oriented cycles. We study the behavior of the -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.
Recommendations
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)