论文信息 - Edge partitions of the complete symmetric directed graph and related designs

Edge partitions of the complete symmetric directed graph and related designs

We show that the edges of the complete symmetric directed graph onn vertices can be partitioned into directed cycles (or anti-directed cycles) of lengthn−1 so that any two distinct cycles have exactly one oppositely directed edge in common whenn=pe>3, wherep is a prime ande is a positive integer. When the cycles are anti-directedp must be odd. We then consider the designs which arise from these partitions and investigate their construction.

[1] Daniel J. Madden,et al. Polynomials that represent quadratic residues at primitive roots. , 1982 .

[2] A. Hedayat,et al. F-square and Orthogonal F-square Designs. A Generalization of Latin Squares and Orthogonal Latin Square Designs , 1970 .

[3] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[4] J. Bermond,et al. Graph decompositions and G-designs , 1976 .

[5] Alexander Rosa,et al. Graph decompositions, handcuffed prisoners and balanced P-designs , 1972, Discret. Math..

[6] J. Dénes,et al. Latin squares and their applications , 1974 .

[7] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[8] Jean-Claude Bermond,et al. Decomposition of the complete directed graph into k-circuits , 1976, J. Comb. Theory B.