The λ-Fold Spectrum Problem for the Oriented Pentagons
Open Access
Abstract
A D-decomposition of a directed graph G is a collection of arc-disjoint subgraphs of G, each isomorphic to D, such that every arc of G belongs to exactly one subgraph. The -fold spectrum problem for a directed graph D asks for the set of all integers v such that the -fold complete symmetric directed graph admits a D-decomposition. A five-cycle (pentagon) has 4 non-isomorphic orientations. The -fold spectrum problem has been solved for one of these oriented pentagons. In this paper, we provide a complete solution for each of the remaining three orientations, proving that the necessary and sufficient condition is in all cases.
Keywords
This publication has 14 references indexed in Scilit:
- The λ -fold Spectrum Problem for the Orientations of the 6-CycleJournal of Combinatorial Mathematics and Combinatorial Computing, 2024
- The λ-Fold Spectrum Problem for the Orientations of the Eight-CycleSymmetry, 2023
- Application-driven graph partitioningThe VLDB Journal, 2022
- Decompositions of complete symmetric directed graphs into the oriented heptagonsTURKISH JOURNAL OF MATHEMATICS, 2021
- A survey on the existence ofG‐DesignsJournal of Combinatorial Designs, 2007
- Cycle decompositions IV: complete directed graphs and fixed length directed cyclesJournal of Combinatorial Theory, Series A, 2003
- Decompositions of complete symmetric digraphs into the oriented pentagonsJournal of the Australian Mathematical Society, 1979
- Partition of the edges of the directed complete graph into 4-cyclesDiscrete Mathematics, 1975
- An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuitsDiscrete Mathematics, 1974
- Directed triple systemsJournal of Combinatorial Theory, Series A, 1973