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...
Saved in:
Main Author: | Maizon, Mohd Darus |
---|---|
Format: | Thesis |
Language: | eng eng |
Published: |
2015
|
Subjects: | |
Online Access: | https://etd.uum.edu.my/5322/1/s808768.pdf https://etd.uum.edu.my/5322/2/s808768_abstract.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Enhanced prim's algorithm for finding the hamiltonian cycle in a graph
by: Dinon, Nur Atiqah
Published: (2013) -
Enhanced prim's algorithm for finding the hamiltonian cycle in a graph
by: Dinon, Nur Atiqah
Published: (2013) -
Hamiltonian circuited simulations of partial differential equations of the elliptic type /
by: Rio Hirowati Shariffudin
Published: (2001) -
On graphs which have strong Hamiltonian properties /
by: Tan, Li Yin
Published: (2010) -
Cubic Hamiltonian graphs and generalized knight's tours /
by: Ong, Siew Hui
Published: (2001)