Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each

Let G be either a complete graph of odd order or a complete bipartite graph in which each vertex partition has an even number of vertices. In this paper, we determine the set of triples (p, q, r), with p, q, r > 0, for which there exists a decomposition of G into p paths, q stars, and r cycles, e...

Full description

Bibliographic Details
Main Author: Shyu Tay-Woei
Format: Article
Language:English
Published: University of Zielona Góra 2021-05-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.2197
_version_ 1797718023079985152
author Shyu Tay-Woei
author_facet Shyu Tay-Woei
author_sort Shyu Tay-Woei
collection DOAJ
description Let G be either a complete graph of odd order or a complete bipartite graph in which each vertex partition has an even number of vertices. In this paper, we determine the set of triples (p, q, r), with p, q, r > 0, for which there exists a decomposition of G into p paths, q stars, and r cycles, each of which has 4 edges.
first_indexed 2024-03-12T08:44:55Z
format Article
id doaj.art-7bf03c70d0bb46e7a384b0114eae11eb
institution Directory Open Access Journal
issn 2083-5892
language English
last_indexed 2024-03-12T08:44:55Z
publishDate 2021-05-01
publisher University of Zielona Góra
record_format Article
series Discussiones Mathematicae Graph Theory
spelling doaj.art-7bf03c70d0bb46e7a384b0114eae11eb2023-09-02T16:29:58ZengUniversity of Zielona GóraDiscussiones Mathematicae Graph Theory2083-58922021-05-0141245146810.7151/dmgt.2197Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges EachShyu Tay-Woei0Division of Preparatory Programs for OverseasChinese Students National Taiwan Normal UniversityNew Taipei City24449, Taiwan, R.O.C.Let G be either a complete graph of odd order or a complete bipartite graph in which each vertex partition has an even number of vertices. In this paper, we determine the set of triples (p, q, r), with p, q, r > 0, for which there exists a decomposition of G into p paths, q stars, and r cycles, each of which has 4 edges.https://doi.org/10.7151/dmgt.2197complete graphcomplete bipartite graphpathstarcycledecomposition05c3805c51
spellingShingle Shyu Tay-Woei
Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each
Discussiones Mathematicae Graph Theory
complete graph
complete bipartite graph
path
star
cycle
decomposition
05c38
05c51
title Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each
title_full Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each
title_fullStr Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each
title_full_unstemmed Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each
title_short Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each
title_sort decompositions of complete bipartite graphs and complete graphs into paths stars and cycles with four edges each
topic complete graph
complete bipartite graph
path
star
cycle
decomposition
05c38
05c51
url https://doi.org/10.7151/dmgt.2197
work_keys_str_mv AT shyutaywoei decompositionsofcompletebipartitegraphsandcompletegraphsintopathsstarsandcycleswithfouredgeseach