On the Decomposition of Cayley Color Graphs into Isomorphic Oriented Trees
dc.contributor.author | Fink J. F. , | en_US |
dc.date.accessioned | 2006-04-10T18:10:05Z | |
dc.date.available | 2006-04-10T18:10:05Z | |
dc.date.issued | 1994-05 | en_US |
dc.identifier.citation | Fink J. F., (1994/05)."On the Decomposition of Cayley Color Graphs into Isomorphic Oriented Trees." Journal of Combinatorial Theory, Series B 61(1): 71-82. <http://hdl.handle.net/2027.42/31595> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6WHT-45P0V42-1J/2/3c41f794754444e6ffed275282e3858f | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/31595 | |
dc.description.abstract | We prove that if [Delta] is a minimal generating set for a nontrivial group [Gamma] and T is an oriented tree having |[Delta]| edges, then the Cayley color graph D[Delta]([Gamma]) can be decomposed into Absolute value of |[Gamma]| edge-disjoint subgraphs, each of which is isomorphic to T; we say that D[Delta]([Gamma]) is T-decomposable. This result is extended to obtain a result concerning H-decompositions of Cayley graphs for weakly connected oriented graphs H. The first result is then used to derive several theorems concerning decompositions of Cayley color graphs into prescribed families of oriented trees. Applications of some of these theorems to the verification of statements about decompositions of the n-dimensional hypercube Qn are also discussed. | en_US |
dc.format.extent | 592609 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | On the Decomposition of Cayley Color Graphs into Isomorphic Oriented Trees | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Univ Michigan, Dept Math & Stat, Dearborn, MI 48128, USA | |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/31595/1/0000524.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1006/jctb.1994.1031 | en_US |
dc.identifier.source | Journal of Combinatorial Theory, Series B | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.