Decompositions of Complete Multigraphs into Cyclic Designs
Let and be positive integer, denote a complete multigraph. A decomposition of a graph is a set of subgraphs of whose edge sets partition the edge set of . The aim of this paper, is to decompose a complete multigraph into cyclic -cycle system according to specified conditions. As the main conse...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Politeknik Negeri Padang
2020-05-01
|
| Series: | JOIV: International Journal on Informatics Visualization |
| Subjects: | |
| Online Access: | http://joiv.org/index.php/joiv/article/view/349 |
| Summary: | Let and be positive integer, denote a complete multigraph. A decomposition of a graph is a set of subgraphs of whose edge sets partition the edge set of . The aim of this paper, is to decompose a complete multigraph into cyclic -cycle system according to specified conditions. As the main consequence, construction of decomposition of into cyclic Hamiltonian wheel system, where , is also given. The difference set method is used to construct the desired designs. |
|---|---|
| ISSN: | 2549-9610 2549-9904 |