On the decomposition of Cayley color graphs into isomorphic oriented trees
Let \(\Delta\) be a minimal generating set for a nontrivial group \(\Gamma\) and \(T\) be an oriented tree with \(| \Delta|\) edges. It is shown that the Cayley color graph \(D_ \Delta(\Gamma)\) can be decomposed into \(|\Gamma|\) edge-disjoint subgraphs, each isomorphic to \(T\). An extension to \(H\)-decompositions of Cayley graphs for weakly connected oriented graphs \(H\), and results about decompositions of Cayley color graphs into prescribed families of oriented trees, are obtained. Applications to decompositions of the \(n\)-dimensional hypercube \(Q_ n\) are discussed.
- scientific article; zbMATH DE number 1556732
- scientific article; zbMATH DE number 1802814
- Hamiltonian decomposition of Cayley graphs of orders \(p^2\) and \(pq\)
- Directed tree decompositions of Cayley digraphs with word-degenerate connection sets
- Hamiltonian decompositions of Cayley graphs on Abelian groups
- scientific article; zbMATH DE number 1802814 (Why is no real title available?)
- scientific article; zbMATH DE number 1556732 (Why is no real title available?)
- On the decomposition of n‐cubes into isomorphic trees
- Directed tree decompositions of Cayley digraphs with word-degenerate connection sets
- scientific article; zbMATH DE number 973934 (Why is no real title available?)
This page was built for publication: On the decomposition of Cayley color graphs into isomorphic oriented trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328386)