Structural Conditions and Algorithms for Cycle–Star Decomposition of Complete Bipartite Graphs
International Journal of Innovative Science and Research Technology · 12.03.2026 · 250
DOI: 10.38124/ijisrt/26mar118 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Innovative Science and Research Technology, online erschienen am 12.03.2026. Verfasst von Ilayaraja M. 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
M., I., C., A., R., B., & R., I. (2026). Structural Conditions and Algorithms for Cycle–Star Decomposition of Complete Bipartite Graphs. International Journal of Innovative Science and Research Technology, 250. https://doi.org/10.38124/ijisrt/26mar118
Vancouver
M. I, C. A, R. B, R. I. Structural Conditions and Algorithms for Cycle–Star Decomposition of Complete Bipartite Graphs. International Journal of Innovative Science and Research Technology. 2026:250. doi:10.38124/ijisrt/26mar118
BibTeX
@article{M2026,
author = {M., Ilayaraja and C., Abiramasundari and R., Bhuvaneswari and R., Imran},
title = {Structural Conditions and Algorithms for Cycle–Star Decomposition of Complete Bipartite Graphs},
journal = {International Journal of Innovative Science and Research Technology},
year = {2026},
pages = {250},
doi = {10.38124/ijisrt/26mar118}
}
EUVIMED