MULTIFACTORIZATION OF COMPLETE GRAPHS INTO EQUAL COPIES OF CYCLES AND PATHS.
Keywords:
Complete Graphs, Multifactorization, Path and Cycle. 2000 Mathematics Subject Classification Number : 05C70,05C38.Abstract
Let Kn (ƛ) denote a complete graph with n vertices with edge multiplicity ƛ. Factorization of a graphis a partition of the given graph into isomorphic spanning subgraphs. A (G,H) – Multifactorization of a graph is a factorization
References
Atif Abueida and M.Daven, Multidesigns for graph – pairs of order 4 and 5, Graphs Combinatorics, 19(4) 2003, 433- 447.
B.Alspach and J.C.Bermond and D.Sotteau, Decomposition into cycles: Hamilton Decompositions in cycles and rays, Kluwer Academic Publishers(1990), 9 -18.
Downloads
Published
2024-03-22
How to Cite
Dr.H.M.PRIYADHARSINI. (2024). MULTIFACTORIZATION OF COMPLETE GRAPHS INTO EQUAL COPIES OF CYCLES AND PATHS. Journal of Computational Analysis and Applications (JoCAAA), 33(06), 3058–3059. Retrieved from https://eudoxuspress.com/index.php/pub/article/view/3807
Issue
Section
Articles
