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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | أطروحة |
| اللغة: | eng eng |
| منشور في: |
2015
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://etd.uum.edu.my/5322/1/s808768.pdf https://etd.uum.edu.my/5322/2/s808768_abstract.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | 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. |
|---|