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

PDF Restricted to Registered users only Download (574kB) | Request a copy

Abstract

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.

Item Type:	Article
Uncontrolled Keywords:	Graph decomposition, complete graph, circuit
Subjects:	Q Science > QA Mathematics
Divisions:	School of Quantitative Sciences
Depositing User:	Prof. Dr. Haslinda Ibrahim
Date Deposited:	06 Aug 2015 02:40
Last Modified:	27 Apr 2016 07:00
URI:	https://repo.uum.edu.my/id/eprint/15049

Actions (login required)

View Item