Decomposition of the λ -Fold Complete Equipartite Graph into Unicyclic Graphs of Order Five
Ars Combinatoria · 2024
DOI: 10.61091/ars-160-08 ↗Kurz gefasst
Fachartikel in der Zeitschrift Ars Combinatoria, 2024. Verfasst von T. Sivakaran.
Abstract (Originalsprache)
For a graph G and a subgraph H of a graph G , an H -decomposition of the graph G is a partition of the edge set of G into subsets E i , 1 ≤ i ≤ k , such that each E i induces a graph isomorphic to H . In this paper, it is proved that every simple connected unicyclic graph of order five decomposes the λ -fold complete equipartite graph whenever the necessary conditions are satisfied. This generalizes a result of Huang, *Utilitas Math.* 97 (2015), 109–117.
Zitieren
APA
Sivakaran, T. (2024). Decomposition of the λ -Fold Complete Equipartite Graph into Unicyclic Graphs of Order Five. Ars Combinatoria. https://doi.org/10.61091/ars-160-08
Vancouver
Sivakaran T. Decomposition of the λ -Fold Complete Equipartite Graph into Unicyclic Graphs of Order Five. Ars Combinatoria. 2024. doi:10.61091/ars-160-08
BibTeX
@article{Sivakaran2024,
author = {Sivakaran, T.},
title = {Decomposition of the λ -Fold Complete Equipartite Graph into Unicyclic Graphs of Order Five},
journal = {Ars Combinatoria},
year = {2024},
doi = {10.61091/ars-160-08}
}
EUVIMED