Sorry, I don't understand your search. ×
Back to Search Start Over

Butterfly Triple System Algorithm Based on Graph Theory

Authors :
Haslinda Ibrahim
Raja'i Aldiabat
Sharmila Karim
Source :
Journal of ICT, Vol 21, Iss 1, Pp 27-49 (2021)
Publication Year :
2021
Publisher :
UUM Press, Universiti Utara Malaysia, 2021.

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.

Details

ISSN :
1675414X
Volume :
21
Database :
OpenAIRE
Journal :
Journal of Information and Communication Technology
Accession number :
edsair.doi.dedup.....7a64f6ab70bfde0dbca0dd79e010ed5c
Full Text :
https://doi.org/10.32890/jict2022.21.1.2