Structural Conditions and Algorithms for Cycle–Star Decompositions of Complete Bipartite Graphs
International Journal of Innovative Science and Research Technology · 05.06.2026 · 3277
DOI: 10.38124/ijisrt/26may1812 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Innovative Science and Research Technology, online erschienen am 05.06.2026. Verfasst von Imran R. und 3 weiteren Autor:innen. Die Arbeit nennt 5 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
R., I., M., I., R., B., & C., A. (2026). Structural Conditions and Algorithms for Cycle–Star Decompositions of Complete Bipartite Graphs. International Journal of Innovative Science and Research Technology, 3277. https://doi.org/10.38124/ijisrt/26may1812
Vancouver
R. I, M. I, R. B, C. A. Structural Conditions and Algorithms for Cycle–Star Decompositions of Complete Bipartite Graphs. International Journal of Innovative Science and Research Technology. 2026:3277. doi:10.38124/ijisrt/26may1812
BibTeX
@article{R2026,
author = {R., Imran and M., Ilayaraja and R., Bhuvaneswari and C., Abiramasundari},
title = {Structural Conditions and Algorithms for Cycle–Star Decompositions of Complete Bipartite Graphs},
journal = {International Journal of Innovative Science and Research Technology},
year = {2026},
pages = {3277},
doi = {10.38124/ijisrt/26may1812}
}
EUVIMED