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...

詳細記述

保存先:
書誌詳細
主要な著者: Mohd Darus, Maizon, Ibrahim, Haslinda, Karim, Sharmila
フォーマット: 論文
言語:English
出版事項: CESER Publications 2015
主題:
オンライン・アクセス:http://repo.uum.edu.my/15049/1/The%20Cons.pdf
http://repo.uum.edu.my/15049/
http://www.ceser.in/ceserp/index.php/ijamas/index
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
id my.uum.repo.15049
record_format eprints
spelling my.uum.repo.150492016-04-27T07:00:03Z http://repo.uum.edu.my/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 http://repo.uum.edu.my/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
institution Universiti Utara Malaysia
building UUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Utara Malaysia
content_source UUM Institutionali Repository
url_provider http://repo.uum.edu.my/
language English
topic QA Mathematics
spellingShingle QA Mathematics
Mohd Darus, Maizon
Ibrahim, Haslinda
Karim, Sharmila
The construction of distinct circuits of length six for complete graph K6
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.
format Article
author Mohd Darus, Maizon
Ibrahim, Haslinda
Karim, Sharmila
author_facet Mohd Darus, Maizon
Ibrahim, Haslinda
Karim, Sharmila
author_sort Mohd Darus, Maizon
title 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_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_sort construction of distinct circuits of length six for complete graph k6
publisher CESER Publications
publishDate 2015
url http://repo.uum.edu.my/15049/1/The%20Cons.pdf
http://repo.uum.edu.my/15049/
http://www.ceser.in/ceserp/index.php/ijamas/index
_version_ 1644281616131948544
score 13.250246