Cover Image

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

Full description

Saved in:
Bibliographic Details
Main Authors: Ahmad, T., Abd. Shukor, N., Idris, A., Mahamud, Z.
Format: Conference or Workshop Item
Published: 2019
Subjects:
QA Mathematics
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!
id my.utm.91908
record_format eprints
spelling my.utm.919082021-07-28T08:48:35Z http://eprints.utm.my/id/eprint/91908/ Hamiltonian polygonal path in assembly graph of FTTM Ahmad, T. Abd. Shukor, N. Idris, A. Mahamud, Z. QA Mathematics 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. 2019 Conference or Workshop Item PeerReviewed 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. http://dx.doi.org/10.1063/1.5136356 DOI: 10.1063/1.5136356
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic QA Mathematics
spellingShingle QA Mathematics
Ahmad, T.
Abd. Shukor, N.
Idris, A.
Mahamud, Z.
Hamiltonian polygonal path in assembly graph of FTTM
description 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.
format Conference or Workshop Item
author Ahmad, T.
Abd. Shukor, N.
Idris, A.
Mahamud, Z.
author_facet Ahmad, T.
Abd. Shukor, N.
Idris, A.
Mahamud, Z.
author_sort Ahmad, T.
title Hamiltonian polygonal path in assembly graph of FTTM
title_short Hamiltonian polygonal path in assembly graph of FTTM
title_full Hamiltonian polygonal path in assembly graph of FTTM
title_fullStr Hamiltonian polygonal path in assembly graph of FTTM
title_full_unstemmed Hamiltonian polygonal path in assembly graph of FTTM
title_sort hamiltonian polygonal path in assembly graph of fttm
publishDate 2019
url http://eprints.utm.my/id/eprint/91908/
http://dx.doi.org/10.1063/1.5136356
_version_ 1706957009053548544
score 13.209306

Similar Items