Hamiltonian polygonal path in assembly graph of FTTM
Fuzzy Topographic Topological Mapping (FTTM) consists of four topological spaces that are homeomorphic to each other. A sequence of FTTMn is a combination of n terms of FTTM. An assembly graph is a graph with all vertices have valency of one or four. A Hamiltonian path is a path that visits every ve...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/91908/ http://dx.doi.org/10.1063/1.5136356 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Fuzzy Topographic Topological Mapping (FTTM) consists of four topological spaces that are homeomorphic to each other. A sequence of FTTMn is a combination of n terms of FTTM. An assembly graph is a graph with all vertices have valency of one or four. A Hamiltonian path is a path that visits every vertices of a graph exactly once. In this paper, we prove an assembly graphs exists in FTTMn and relation between the Hamiltonian polygonal paths and assembly graph of FTTMn. Several definitions and theorems are developed for the purpose. |
|---|