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

وصف كامل

التفاصيل البيبلوغرافية
المؤلف الرئيسي: Maizon, Mohd Darus
التنسيق: أطروحة
اللغة:الإنجليزية
الإنجليزية
منشور في: 2015
الموضوعات:
الوصول للمادة أونلاين:https://etd.uum.edu.my/5322/1/s808768.pdf
https://etd.uum.edu.my/5322/2/s808768_abstract.pdf
https://etd.uum.edu.my/5322/
http://sierra.uum.edu.my/record=b1272239~S1
Abstract Abstract here
_version_ 1855574042214400000
author Maizon, Mohd Darus
author_facet Maizon, Mohd Darus
author_sort Maizon, Mohd Darus
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
id oai:etd.uum.edu.my:5322
institution Universiti Utara Malaysia
language English
English
publishDate 2015
record_format EPrints
record_pdf Restricted
spelling oai:etd.uum.edu.my:53222021-04-04T07:32:55Z https://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 https://etd.uum.edu.my/5322/1/s808768.pdf text en https://etd.uum.edu.my/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
spellingShingle QA Mathematics
Maizon, Mohd Darus
Geometric representations of distinct Hamiltonian circuits in complete graph decomposition
thesis_level Master
title 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_short Geometric representations of distinct Hamiltonian circuits in complete graph decomposition
title_sort geometric representations of distinct hamiltonian circuits in complete graph decomposition
topic QA Mathematics
url https://etd.uum.edu.my/5322/1/s808768.pdf
https://etd.uum.edu.my/5322/2/s808768_abstract.pdf
https://etd.uum.edu.my/5322/
http://sierra.uum.edu.my/record=b1272239~S1
work_keys_str_mv AT maizonmohddarus geometricrepresentationsofdistincthamiltoniancircuitsincompletegraphdecomposition