Decomposition of $\lambda$- fold complete equipartite graphs into connected unicyclic bipartite graphs with eight edges

Year 2025, Volume: 54 Issue: 6, 2306 - 2321, 30.12.2025

Duraimurugan S , S. Ganesamurthy , Muthusamy A

https://doi.org/10.15672/hujms.1333681

Abstract

In this paper, we obtain necessary and sufficient conditions for the decomposition of $\lambda$-fold complete equipartite graphs into connected unicyclic bipartite graphs with eight edges.

Keywords

decomposition , wreath product , tensor product , unicyclic graph

Supporting Institution

The first author thank the Periyar University, Tami Nadu, India, for its support through University Research Fellowship; The second author thank University Grants Commission, Government of India, New Delhi for its support through Dr. S. Kothari Postdoctoral Fellowship; The corresponding author thank the University Grants Commission, New Delhi for its support through SAP

Project Number

1) University Research Fellowship Grant no: PU/ AD-3/URF/015723/2020; 2) Dr. S. Kothari Postdoctoral Fellowship, Grant no: F.4-2/2006(BSR)/MA/2021/0067; 3) SAP Grant no: F.510/7/DRS-I/2016(SAP-I)

References

• [1] P. Adams, D. Bryant, and M. Buchanan, A Survey on the Existence of G-Designs, J. Combin. Des. 16, 373-410, 2008.
• [2] J. Fahnenstiel and D. Froncek, Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges, Electron. J. Graph Theory Appl. 7 (2), 235- 250, 2019.
• [3] B. Freyberg and D. Froncek, Decomposition of complete graps into unicyclic graphs with eight edges, J. Combin. Math. Combin. Comput. 114, 113-132, 2020.
• [4] B. Freyberg and N. Tran, Decomposition of complete graps into unicyclic bipartite graphs with eight edges, J. Combin. Math. Combin. Comput. 114, 133-142, 2020.
• [5] D. Froncek, and O. Kingston, Decomposition of complete graphs into connected unicyclic graphs with eight edges and pentagon, Indonesian J. Combin. 3 (1), 24-33, 2019.
• [6] D. Froncek and M. Kubesa, Decomposition of complete graphs into connected unicyclic bipartite graphs with seven edges, Bull. Inst. Combin. Appl. 93, 52-80, 2021.
• [7] D. Froncek and B. Kubik, Decomposition of complete graphs into tri-cyclic graphs with eight edges, J. Combin. Math. Combin. Comput. 114 , 143-166, 2020.
• [8] D. Froncek and J. Lee, Decomposition of complete graphs into bi-cyclic graphs with eight edges, Bull. Inst. Combin. Appl. 88, 30-49, 2020.
• [9] M. H. Huang, Decomposing complete equipartite graphs into connected unicyclic graphs of size five, Util. Math. 97, 109-117, 2015.
• [10] P. Paulraja and T. Sivakaran, Decompositions of some regular graphs into unicyclic graphs of order five, Discrete Math. Algorithms and Appl. 11 (4), 1950042, 2019.
• [11] K. Sowndhariya and A. Muthusamy, Decomposition of product graphs into sunlet graphs of order eight, J. Algebra Comb. Discrete Appl. 8 (1), 41-51, 2021.
• [12] M.Tarsi, Decomposition of a Complete Multigraph into Simple Paths: Nonbalanced Handcuffed Designs, J. Combin. Theory Ser A. 34, 60-70, 1983.
• [13] J. Tian, Y. Du, and Q. Kang, Decomposing complete graphs into graphs with six vertices and seven edges, Ars Combin. 81, 257-279, 2006.