Authors : Ilayaraja M.; Abiramasundari C.; Bhuvaneswari R.; Imran R.

Volume/Issue : Volume 11 - 2026, Issue 3 - March

---

Google Scholar : https://tinyurl.com/mv8uwtwt

Scribd : https://tinyurl.com/a679xcf9

DOI : https://doi.org/10.38124/ijisrt/26mar118

Note : A published paper may take 4-5 working days from the publication date to appear in PlumX Metrics, Semantic Scholar, and ResearchGate.

---

Abstract : This paper establishes necessary and sufficient conditions for the existence of decompositions of complete bipartite graphs into cycles and stars in certain classes of cases. Explicit constructions are provided for all admissible parameter sets. In addition, a Python implementation is developed to verify the theoretical conditions and to generate corresponding decompositions.

References :

1. Alspach, B., Gavlas, H. (2001). Cycle decompositions of K_n and K_n − I. Journal of Combinatorial Theory, Series B, 81(1), 77–99.
2. Bondy, J. A., Murty, U. R. S. (1976). Graph Theory with Applications. Macmillan Press, New York.
3. Jeevadoss, S., Muthusamy, A. (2014). Decomposition of complete bipartite graphs into paths and cycles. Discrete Mathematics, 331, 98–108.
4. M. Ilayaraja and A. Muthusamy, Decomposition of Complete Graphs, Indian Journal of Discrete Mathematics, 4 (2018), 13–33.
5. M. Ilayaraja and A. Muthusamy, Decomposition of Complete Bipartite Graphs into Cycles and Stars with Four Edges, AKCE International Journal of Graphs and Combinatorics, 17. (2020), 697–702.