Ibrahim, Haslinda and Aldiabat, Raja’i and Karim, Sharmila (2022) Butterfly Triple System Algorithm Based on Graph Theory. Journal of Information and Communication Technology, 21 (01). pp. 27-49. ISSN 2180-3862

Preview

PDF - Published Version Available under License Attribution 4.0 International (CC BY 4.0). Download (3MB) | Preview

Abstract

In combinatorial design theory, clustering elements into a set of three elements is the heart of classifying data, which has recently received considerable attention in the fields of network algorithms, cryptography, design and analysis of algorithms, statistics, and Information theory. This article provides insight into formulating algorithm for a new type of triple system, called a Butterfly triple system. Basically, in this algorithm development, a starter of cyclic near-resolvable ((v-1)/2)-cycle system of the 2-fold complete graph 2Kvis employed to construct the starter of cyclic ((v-1)/2)-star decomposition of 2Kv. These starters are then decomposed into triples and classified as a starter of cyclic Butterfly triple. The obtained starter set generates a triple system of order v. A special reference for case ν ≡ 9 (mod 12) is presented to demonstrate the development of the Butterfly triple system.

Item Type:	Article
Uncontrolled Keywords:	Cyclic triple system, graph decompositions
Subjects:	Q Science > QA Mathematics
Divisions:	College of Arts and Sciences
Depositing User:	Mrs Nurin Jazlina Hamid
Date Deposited:	25 Jul 2022 08:19
Last Modified:	08 Feb 2023 01:08
URI:	https://repo.uum.edu.my/id/eprint/28751

Actions (login required)

View Item