Open Access Open Access  Restricted Access Subscription or Fee Access

The Construction of Distinct Circuits of Length Six for Complete Graph

M. M. Darus, H. Ibrahim, S. Karim


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


Graph decomposition, complete graph, circuit

Full Text:


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information. Also: DOI is paid service which provided by a third party. We never mentioned that we go for this for our any journal. However, journal have no objection if author go directly for this paid DOI service.