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

Noorsufia Abd Shukor | Zendy; Tahir Ahmad | Zendy; Amidora Idris | Zendy; Siti Rahmah Awang | Zendy; Amirul Aizad Ahmad Fuad | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Noorsufia Abd Shukor,

Tahir Ahmad,

Amidora Idris,

Siti Rahmah Awang,

Amirul Aizad Ahmad Fuad

Publication year - 2021

Publication title -

journal of mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.252

H-Index - 13

eISSN - 2314-4785

pISSN - 2314-4629

DOI - 10.1155/2021/7519643

Subject(s) - fibonacci number , combinatorics , valency , mathematics , hamiltonian path , graph , hamiltonian (control theory) , discrete mathematics , vertex (graph theory) , topology (electrical circuits) , mathematical optimization , philosophy , linguistics

A generated n-sequence of fuzzy topographic topological mapping, FTTM n , 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 FTTM n and establish their relations to the Hamiltonian polygonal paths. Finally, the relation between the Hamiltonian polygonal paths induced from FTTM n to the k-Fibonacci sequence is established and their upper and lower bounds’ number of paths is determined.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research