Full text
... In this paper we introduce a new class of iterative networks using Fibonacci numbers, which we call Fibonacci networks. We investigate their graph-theoretic properties and study their suitability for implementing multicomputer systems. The paper is organized as follows: In section 2 we show how Fibo ...
... In this paper we introduce a new class of iterative networks using Fibonacci numbers, which we call Fibonacci networks. We investigate their graph-theoretic properties and study their suitability for implementing multicomputer systems. The paper is organized as follows: In section 2 we show how Fibo ...
Full text
... Here, we wish to enlarge these notions to more general recurrence-generated number sequences and then to generalize our result to ^-dimensional Euclidean space. To accomplish this objective, we will need to introduce a symbol £(£, m, n), originally defined in [2] in relation to Fibonacci numbers onl ...
... Here, we wish to enlarge these notions to more general recurrence-generated number sequences and then to generalize our result to ^-dimensional Euclidean space. To accomplish this objective, we will need to introduce a symbol £(£, m, n), originally defined in [2] in relation to Fibonacci numbers onl ...
1 Graphs and isomorphism
... that the number of loops at v must also equal the number of loops at f (v). The motivating idea here is that if G and H are isomorphic then they are identical, “in every way that matters.” For example, the way that G and H are drawn does not matter. The labels we put on the vertices of G and H does ...
... that the number of loops at v must also equal the number of loops at f (v). The motivating idea here is that if G and H are isomorphic then they are identical, “in every way that matters.” For example, the way that G and H are drawn does not matter. The labels we put on the vertices of G and H does ...
