The construction of distinct circuits of length six for complete graph K6

The emergent applications of complete graph in diverse domains have invited numerous works in this subject matter.Studies related to the decomposition of complete graph such as one-factor, several ɳ-gons and Cartesian product have been solved.Yet, the decomposition of complete graph into distinct ci...

Full description

Bibliographic Details
Main Authors: Mohd Darus, Maizon, Ibrahim, Haslinda, Karim, Sharmila
Format: Article
Language:English
Published: CESER Publications 2015
Subjects:
Online Access:https://repo.uum.edu.my/id/eprint/15049/1/The%20Cons.pdf
_version_ 1803626901241069568
author Mohd Darus, Maizon
Ibrahim, Haslinda
Karim, Sharmila
author_facet Mohd Darus, Maizon
Ibrahim, Haslinda
Karim, Sharmila
author_sort Mohd Darus, Maizon
collection UUM
description The emergent applications of complete graph in diverse domains have invited numerous works in this subject matter.Studies related to the decomposition of complete graph such as one-factor, several ɳ-gons and Cartesian product have been solved.Yet, the decomposition of complete graph into distinct circuits still has not been done.Thus, this paper aims to investigate the structure of complete graph, and in particular, the decomposing of complete graph of length six.The decomposition algorithm will be presented to enumerate distinct circuits of length six. Along this process, the adjacency matrices will be used to clarify distinct structures of circuits in a complete graph of length six.
first_indexed 2024-07-04T05:57:32Z
format Article
id uum-15049
institution Universiti Utara Malaysia
language English
last_indexed 2024-07-04T05:57:32Z
publishDate 2015
publisher CESER Publications
record_format dspace
spelling uum-150492016-04-27T07:00:03Z https://repo.uum.edu.my/id/eprint/15049/ The construction of distinct circuits of length six for complete graph K6 Mohd Darus, Maizon Ibrahim, Haslinda Karim, Sharmila QA Mathematics The emergent applications of complete graph in diverse domains have invited numerous works in this subject matter.Studies related to the decomposition of complete graph such as one-factor, several ɳ-gons and Cartesian product have been solved.Yet, the decomposition of complete graph into distinct circuits still has not been done.Thus, this paper aims to investigate the structure of complete graph, and in particular, the decomposing of complete graph of length six.The decomposition algorithm will be presented to enumerate distinct circuits of length six. Along this process, the adjacency matrices will be used to clarify distinct structures of circuits in a complete graph of length six. CESER Publications 2015 Article PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/15049/1/The%20Cons.pdf Mohd Darus, Maizon and Ibrahim, Haslinda and Karim, Sharmila (2015) The construction of distinct circuits of length six for complete graph K6. International Journal of Applied Mathematics and Statistics™ (IJAMAS), 53 (1). pp. 1-14. ISSN 0973-7545 http://www.ceser.in/ceserp/index.php/ijamas/index
spellingShingle QA Mathematics
Mohd Darus, Maizon
Ibrahim, Haslinda
Karim, Sharmila
The construction of distinct circuits of length six for complete graph K6
title The construction of distinct circuits of length six for complete graph K6
title_full The construction of distinct circuits of length six for complete graph K6
title_fullStr The construction of distinct circuits of length six for complete graph K6
title_full_unstemmed The construction of distinct circuits of length six for complete graph K6
title_short The construction of distinct circuits of length six for complete graph K6
title_sort construction of distinct circuits of length six for complete graph k6
topic QA Mathematics
url https://repo.uum.edu.my/id/eprint/15049/1/The%20Cons.pdf
work_keys_str_mv AT mohddarusmaizon theconstructionofdistinctcircuitsoflengthsixforcompletegraphk6
AT ibrahimhaslinda theconstructionofdistinctcircuitsoflengthsixforcompletegraphk6
AT karimsharmila theconstructionofdistinctcircuitsoflengthsixforcompletegraphk6
AT mohddarusmaizon constructionofdistinctcircuitsoflengthsixforcompletegraphk6
AT ibrahimhaslinda constructionofdistinctcircuitsoflengthsixforcompletegraphk6
AT karimsharmila constructionofdistinctcircuitsoflengthsixforcompletegraphk6