Combinatorial structure of cube of fuzzy topographic topological mapping and K-fibonacci sequence

Fuzzy Topographic Topological Mapping (FTTM) is a model for solving neuromagnetic inverse problem. FTTM consists of four topological spaces that are homeomorphic to each other. A sequence of FTTMn is a combination of n terms of FTTM. In previous studies, FTTM are linked with three mathematical conce...

Full description

Saved in:
Bibliographic Details
Main Author: Abd. Shukor, Noorsufia
Format: Thesis
Language:English
Published: 2020
Subjects:
Online Access:http://eprints.utm.my/id/eprint/101966/1/NoorsufiaAbdShukorMFS2020.pdf
http://eprints.utm.my/id/eprint/101966/
http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:148570
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Teknologi Malaysia
Language: English
id my.utm.101966
record_format eprints
spelling my.utm.1019662023-07-25T09:57:47Z http://eprints.utm.my/id/eprint/101966/ Combinatorial structure of cube of fuzzy topographic topological mapping and K-fibonacci sequence Abd. Shukor, Noorsufia QA Mathematics Fuzzy Topographic Topological Mapping (FTTM) is a model for solving neuromagnetic inverse problem. FTTM consists of four topological spaces that are homeomorphic to each other. A sequence of FTTMn is a combination of n terms of FTTM. In previous studies, FTTM are linked with three mathematical concepts namely; FTTM with Pascal’s Triangle, FTTM as a graph and FTTM in relation to k-Fibonacci sequence. In this research, the relationship between graph of FTTMn and k-Fibonacci is established via Hamiltonian polygonal paths in an assembly graph of FTTMn. The assembly graph is a graph with all vertices have valency of one or four. The Hamiltonian path is a path that visits every vertex of a graph exactly once. The structure of assembly graph of FTTMn including maximal assembly graph of FTTMn is introduced and its properties are investigated. The existence of Hamiltonian polygonal path in maximal assembly graph of FTTMn is proven. Several new definitions and theorems for the assembly graph of FTTMn and Hamiltonian polygonal path in maximal assembly graph of FTTMn are stated and proven, respectively. Finally, a theorem that highlight the relation between graph of FTTMn to k-Fibonacci sequence is proven. 2020 Thesis NonPeerReviewed application/pdf en http://eprints.utm.my/id/eprint/101966/1/NoorsufiaAbdShukorMFS2020.pdf Abd. Shukor, Noorsufia (2020) Combinatorial structure of cube of fuzzy topographic topological mapping and K-fibonacci sequence. Masters thesis, Universiti Teknologi Malaysia. http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:148570
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/
language English
topic QA Mathematics
spellingShingle QA Mathematics
Abd. Shukor, Noorsufia
Combinatorial structure of cube of fuzzy topographic topological mapping and K-fibonacci sequence
description Fuzzy Topographic Topological Mapping (FTTM) is a model for solving neuromagnetic inverse problem. FTTM consists of four topological spaces that are homeomorphic to each other. A sequence of FTTMn is a combination of n terms of FTTM. In previous studies, FTTM are linked with three mathematical concepts namely; FTTM with Pascal’s Triangle, FTTM as a graph and FTTM in relation to k-Fibonacci sequence. In this research, the relationship between graph of FTTMn and k-Fibonacci is established via Hamiltonian polygonal paths in an assembly graph of FTTMn. The assembly graph is a graph with all vertices have valency of one or four. The Hamiltonian path is a path that visits every vertex of a graph exactly once. The structure of assembly graph of FTTMn including maximal assembly graph of FTTMn is introduced and its properties are investigated. The existence of Hamiltonian polygonal path in maximal assembly graph of FTTMn is proven. Several new definitions and theorems for the assembly graph of FTTMn and Hamiltonian polygonal path in maximal assembly graph of FTTMn are stated and proven, respectively. Finally, a theorem that highlight the relation between graph of FTTMn to k-Fibonacci sequence is proven.
format Thesis
author Abd. Shukor, Noorsufia
author_facet Abd. Shukor, Noorsufia
author_sort Abd. Shukor, Noorsufia
title Combinatorial structure of cube of fuzzy topographic topological mapping and K-fibonacci sequence
title_short Combinatorial structure of cube of fuzzy topographic topological mapping and K-fibonacci sequence
title_full Combinatorial structure of cube of fuzzy topographic topological mapping and K-fibonacci sequence
title_fullStr Combinatorial structure of cube of fuzzy topographic topological mapping and K-fibonacci sequence
title_full_unstemmed Combinatorial structure of cube of fuzzy topographic topological mapping and K-fibonacci sequence
title_sort combinatorial structure of cube of fuzzy topographic topological mapping and k-fibonacci sequence
publishDate 2020
url http://eprints.utm.my/id/eprint/101966/1/NoorsufiaAbdShukorMFS2020.pdf
http://eprints.utm.my/id/eprint/101966/
http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:148570
_version_ 1772811136026017792