Ahmad, T. and Abd. Shukor, N. and Idris, A. and Mahamud, Z. (2019) Hamiltonian polygonal path in assembly graph of FTTM. In: Innovative Technologies for Mathematics and Mathematics for Technological Innovation, MathTech 2018, 10-12 Dec 2018, Pulau Pinang, Malaysia.
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1063/1.5136356
Abstract
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | Hamiltonian path, homeomorphic |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Science |
| ID Code: | 91908 |
| Deposited By: | Narimah Nawil |
| Deposited On: | 28 Jul 2021 08:48 |
| Last Modified: | 28 Jul 2021 08:48 |
Repository Staff Only: item control page
