Circulant homogeneous factorizations of complete graphs

MaRDI QIDQ3110848zbMATH OpenFDO

Authors Xiaohui Zhang, Jianyue Lu, Gen-Liang Li, Huihong Wu, Jiangmin Pan

Publication date 27 January 2012

zbMATH Keywords

complete graphCayley homogeneous factorizationcirculant homogeneous factorization

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph designs and isomorphic decomposition (05C51)

Recommendations

• Common circulant homogeneous factorisations of the complete digraph
• Homogeneous factorisations of complete multipartite graphs
• Constructing homogeneous factorisations of complete graphs and digraphs
• Circulant homogeneous factorisations of complete digraphs \(\mathbf K_{p^{d}}\) with \(p\) an odd prime
• Homogeneous factorisations of complete graphs with edge-transitive factors

Cited in

(5)

• Constructing homogeneous factorisations of complete graphs and digraphs
• \(C_ n\)-factors of group graphs
• Circulant homogeneous factorisations of complete digraphs \(\mathbf K_{p^{d}}\) with \(p\) an odd prime
• Common circulant homogeneous factorisations of the complete digraph
• Homogeneous factorisations of graphs and digraphs

This page was built for publication: Circulant homogeneous factorizations of complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3110848)