Multifactorization of Complete Graphs into Equal Copies of Stars and Paths
Article Sidebar
Main Article Content
Abstract
Let Kn (λ) denote a complete graph with n vertices with edge multiplicity λ. Factorization of a graph is a partition of the given graph into isomorphic spanning subgraphs. A (G,H) – Multifactorization of a graph is a factorization of given graph into G and H with atleast one copy of G and H. In this paper, we studied about the (G,H) – Multifactorization of Kn with equal copies of G and H, where G is a Star factor and H is a Path Factor
Article Details
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.
H.M.Priyadharsini, Multidecomposition and Multifactorization of Multigraphs, Ph.D., Thesis, Bharathidasan University, 2013.
H.M.Priyadharsini, Multifactorization of Complete Graphs into equal copies of Cycles and Paths, Journal of Computational Analysis and Applications, Vol 33, No.(6) 2024, 3058 – 3059.
D.G.Sarvate, Li Zhang, Decomposition of a kv, into equal number of K3 and P3, Bulletin of the ICA, 67(2013), 43- 48.
Graph Theory and Decomposition, Jomon Kottarathil, Sudev Naduvath and Joseph Varghese Kureethara, CRC Press, 2020.