On the Decompositions of Complete Graphs into Cycles and Stars on the Same Number of Edges
Let Cm and Sm denote a cycle and a star on m edges, respectively. We investigate the decomposition of the complete graphs, Kn, into cycles and stars on the same number of edges. We give an algorithm that determines values of n, for a given value of m, where Kn is {Cm, Sm}-decomposable. We show that...
Tallennettuna:
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
University of Zielona Góra
2014-02-01
|
| Sarja: | Discussiones Mathematicae Graph Theory |
| Aiheet: | |
| Linkit: | https://doi.org/10.7151/dmgt.1719 |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|