Graph of fuzzy topographic topological mapping in relation to \(k\)-Fibonacci sequence (Q2666445)

Summary: A generated \(n\)-sequence of fuzzy topographic topological mapping, \(\mathrm{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 \(\mathrm{FTTM}_n\) and establish their relations to the Hamiltonian polygonal paths. Finally, the relation between the Hamiltonian polygonal paths induced from \(\mathrm{FTTM}_n\) to the \(k\)-Fibonacci sequence is established and their upper and lower bounds' number of paths is determined.