Graph of Fuzzy Topographic Topological Mapping in relation to k-Fibonacci Sequence

A generated n-sequence of fuzzy topographic topological mapping, FTTMn, is a combination of n number of FTTM’s graphs. An assembly graph is a graph whereby its vertices have valency of one or four. A Hamiltonian path is a path that visits every vertex of the graph exactly once. In this paper, we pro...

Full description

Saved in:
Bibliographic Details
Published in:Journal of mathematics (Hidawi) 2021, Vol.2021, p.1-10
Main Authors: Shukor, Noorsufia Abd, Ahmad, Tahir, Idris, Amidora, Awang, Siti Rahmah, Ahmad Fuad, Amirul Aizad
Format: Article
Language:English
Subjects:
Apexes
Assembly
Fibonacci numbers
Graph theory
Graphs
Lower bounds
Magnetic fields
Mapping
Mathematics
Polygons
Sequences
Topography
Topology
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A generated n-sequence of fuzzy topographic topological mapping, FTTMn, is a combination of n number of FTTM’s graphs. An assembly graph is a graph whereby its vertices have valency of one or four. A Hamiltonian path is a path that visits every vertex of the graph exactly once. In this paper, we prove that assembly graphs exist in FTTMn and establish their relations to the Hamiltonian polygonal paths. Finally, the relation between the Hamiltonian polygonal paths induced from FTTMn to the k-Fibonacci sequence is established and their upper and lower bounds’ number of paths is determined.
ISSN:2314-4629
2314-4785
DOI:10.1155/2021/7519643