Geometric representations of distinct Hamiltonian circuits in complete graph decomposition

Visualization of geometric representations of distinct Hamiltonian circuits in complete graphs is needed to avoid structures resemblance in real application. However, there are only a few studies that consider graph visualization, whereas most researchers focus on computation time. Thus, this study...

Full description

Saved in:
Bibliographic Details
Main Author: Maizon, Mohd Darus
Format: Thesis
Language:English
English
Published: 2015
Subjects:
Online Access:http://etd.uum.edu.my/5322/
http://sierra.uum.edu.my/record=b1272239~S1
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uum.etd.5322
record_format eprints
spelling my.uum.etd.53222021-04-04T07:32:55Z http://etd.uum.edu.my/5322/ Geometric representations of distinct Hamiltonian circuits in complete graph decomposition Maizon, Mohd Darus QA Mathematics Visualization of geometric representations of distinct Hamiltonian circuits in complete graphs is needed to avoid structures resemblance in real application. However, there are only a few studies that consider graph visualization, whereas most researchers focus on computation time. Thus, this study aims to construct a novel picturing method called Half Butterfly Method (HBM) to address the aforementioned scenario. Towards developing HBM, the concept of Wing Strategy is introduced to create directions from one vertex to another vertex. Then, these directions are used to map distinct vertices. In order to obtain the distinct Hamiltonian circuits, the concept of matrix transpose is used to capture the mirror image of that circuit. Several new theorems and lemmas are proved in the decomposition of complete graphs into distinct Hamiltonian circuits. Furthermore, the result of HBM is applied to list. 2015 Thesis NonPeerReviewed text en /5322/1/s808768.pdf text en /5322/2/s808768_abstract.pdf Maizon, Mohd Darus (2015) Geometric representations of distinct Hamiltonian circuits in complete graph decomposition. Masters thesis, Universiti Utara Malaysia. http://sierra.uum.edu.my/record=b1272239~S1
institution Universiti Utara Malaysia
building UUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Utara Malaysia
content_source UUM Electronic Theses
url_provider http://etd.uum.edu.my/
language English
English
topic QA Mathematics
spellingShingle QA Mathematics
Maizon, Mohd Darus
Geometric representations of distinct Hamiltonian circuits in complete graph decomposition
description Visualization of geometric representations of distinct Hamiltonian circuits in complete graphs is needed to avoid structures resemblance in real application. However, there are only a few studies that consider graph visualization, whereas most researchers focus on computation time. Thus, this study aims to construct a novel picturing method called Half Butterfly Method (HBM) to address the aforementioned scenario. Towards developing HBM, the concept of Wing Strategy is introduced to create directions from one vertex to another vertex. Then, these directions are used to map distinct vertices. In order to obtain the distinct Hamiltonian circuits, the concept of matrix transpose is used to capture the mirror image of that circuit. Several new theorems and lemmas are proved in the decomposition of complete graphs into distinct Hamiltonian circuits. Furthermore, the result of HBM is applied to list.
format Thesis
author Maizon, Mohd Darus
author_facet Maizon, Mohd Darus
author_sort Maizon, Mohd Darus
title Geometric representations of distinct Hamiltonian circuits in complete graph decomposition
title_short Geometric representations of distinct Hamiltonian circuits in complete graph decomposition
title_full Geometric representations of distinct Hamiltonian circuits in complete graph decomposition
title_fullStr Geometric representations of distinct Hamiltonian circuits in complete graph decomposition
title_full_unstemmed Geometric representations of distinct Hamiltonian circuits in complete graph decomposition
title_sort geometric representations of distinct hamiltonian circuits in complete graph decomposition
publishDate 2015
url http://etd.uum.edu.my/5322/
http://sierra.uum.edu.my/record=b1272239~S1
_version_ 1696978282538336256
score 13.160551