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 consequenc...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | 論文 |
| 言語: | English |
| 出版事項: |
Society of Visual Informatics, and Institute of Visual Informatics - UKM and Soft Computing and Data Mining Centre - UTHM
2020
|
| 主題: | |
| オンライン･アクセス: | https://repo.uum.edu.my/id/eprint/30780/1/JOIV%2004%2002%202020%2080-84.pdf https://repo.uum.edu.my/id/eprint/30780/ https://joiv.org/index.php/joiv |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| id |
my.uum.repo.30780 |
|---|---|
| record_format |
eprints |
| spelling |
my.uum.repo.307802024-04-30T13:14:53Z https://repo.uum.edu.my/id/eprint/30780/ Decompositions of Complete Multigraphs into Cyclic Designs Alqadri, Mowafaq Ibrahim, Haslinda Karims, Sharmila QA Mathematics 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 Society of Visual Informatics, and Institute of Visual Informatics - UKM and Soft Computing and Data Mining Centre - UTHM 2020 Article PeerReviewed application/pdf en cc4_by_sa https://repo.uum.edu.my/id/eprint/30780/1/JOIV%2004%2002%202020%2080-84.pdf Alqadri, Mowafaq and Ibrahim, Haslinda and Karims, Sharmila (2020) Decompositions of Complete Multigraphs into Cyclic Designs. International Journal On Informatics Visualization, 4 (2). pp. 80-84. ISSN 2549-9904 https://joiv.org/index.php/joiv |
| institution |
Universiti Utara Malaysia |
| building |
UUM Library |
| collection |
Institutional Repository |
| continent |
Asia |
| country |
Malaysia |
| content_provider |
Universiti Utara Malaysia |
| content_source |
UUM Institutional Repository |
| url_provider |
http://repo.uum.edu.my/ |
| language |
English |
| topic |
QA Mathematics |
| spellingShingle |
QA Mathematics Alqadri, Mowafaq Ibrahim, Haslinda Karims, Sharmila Decompositions of Complete Multigraphs into Cyclic Designs |
| description |
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 |
| format |
Article |
| author |
Alqadri, Mowafaq Ibrahim, Haslinda Karims, Sharmila |
| author_facet |
Alqadri, Mowafaq Ibrahim, Haslinda Karims, Sharmila |
| author_sort |
Alqadri, Mowafaq |
| title |
Decompositions of Complete Multigraphs into Cyclic Designs |
| title_short |
Decompositions of Complete Multigraphs into Cyclic Designs |
| title_full |
Decompositions of Complete Multigraphs into Cyclic Designs |
| title_fullStr |
Decompositions of Complete Multigraphs into Cyclic Designs |
| title_full_unstemmed |
Decompositions of Complete Multigraphs into Cyclic Designs |
| title_sort |
decompositions of complete multigraphs into cyclic designs |
| publisher |
Society of Visual Informatics, and Institute of Visual Informatics - UKM and Soft Computing and Data Mining Centre - UTHM |
| publishDate |
2020 |
| url |
https://repo.uum.edu.my/id/eprint/30780/1/JOIV%2004%2002%202020%2080-84.pdf https://repo.uum.edu.my/id/eprint/30780/ https://joiv.org/index.php/joiv |
| _version_ |
1800099900954771456 |
| score |
13.251813 |