Decomposition of graphs into trees of order five
Journal of Combinatorial Mathematics and Combinatorial Computing · 09.05.2026 · 130 · 325-353
DOI: 10.61091/jcmcc130-20 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Mathematics and Combinatorial Computing, online erschienen am 09.05.2026. Verfasst von Hemalatha p und 1 weiteren Autor:innen.
Abstract (Originalsprache)
A {P5α, S5β, Y5γ}-decomposition of a graph is a partition of its edge set into α copies of P5, β copies of S5, and γ copies of Y5, where P5, S5, and Y5 denote the three non-isomorphic trees of order five. In this paper, we study the existence of a {P5α, S5β, Y5γ}-decomposition of the complete bipartite graph Km, n for m ≥ 4 and n ≥ 2, and of the complete graph Kn for n ≥ 8. In fact, we establish necessary and sufficient conditions for the existence of such decompositions in Km, n and Kn.
Zitieren
APA
p, H., & A, C. (2026). Decomposition of graphs into trees of order five. Journal of Combinatorial Mathematics and Combinatorial Computing, 130, 325-353. https://doi.org/10.61091/jcmcc130-20
Vancouver
p H, A C. Decomposition of graphs into trees of order five. Journal of Combinatorial Mathematics and Combinatorial Computing. 2026;130:325-353. doi:10.61091/jcmcc130-20
BibTeX
@article{p2026,
author = {p, Hemalatha and A, Chaadhanaa},
title = {Decomposition of graphs into trees of order five},
journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
year = {2026},
volume = {130},
pages = {325--353},
doi = {10.61091/jcmcc130-20}
}
EUVIMED