Common circulant homogeneous factorisations of the complete digraph

DOI10.1016/j.disc.2008.07.034zbMath1218.05146OpenAlexW2081637165WikidataQ56987696 ScholiaQ56987696MaRDI QIDQ1025915

Cheryl E. Praeger, Linda Stringer, Cai Heng Li

Publication date: 23 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.07.034

zbMATH Keywords

complete graphcirculantcomplete digraphhomogeneous factorisationcirculant factor digraphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Circulant homogeneous factorisations of complete digraphs \(\mathbf K_{p^{d}}\) with \(p\) an odd prime ⋮ On finite permutation groups with a transitive cyclic subgroup. ⋮ On finite self-complementary metacirculants

Cites Work

• Unnamed Item
• Unnamed Item
• Toida's conjecture is true
• Corrigendum to: On Ádám's conjecture for circulant graphs
• The existence of selfcomplementary circulant graphs
• Ádám's conjecture is true in the square-free case
• Isomorphic Cayley graphs on nonisomorphic groups
• On Sylow Subgraphs of Vertex-Transitive Self-Complementary Graphs
• The Finite Primitive Permutation Groups Containing an Abelian Regular Subgroup
• Cyclic regular subgroups of primitive permutation groups
• On partitioning the orbitals of a transitive permutation group

This page was built for publication: Common circulant homogeneous factorisations of the complete digraph