Fibonacci digraph and its entropy

MaRDI QIDQ2883411zbMATH OpenFDO

Authors Ippei Tajima, Yasuichi Horibe

Publication date 10 May 2012

Published in Congressus Numerantium (Search for Journal in Brave)

zbMATH Keywords

entropyFibonacci digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Review text

The paper is to generalize a simple digraph in order to define the \(k\)-Fibonacci digraph in connection with generalized Fibonacci number and with the well-known positive root of certain equation. The main objective of the paper is to offer elementary proofs of some relations without recourse to the Frobenius theory on non-negative matrices and without the irreducibility assumption.

Recommendations

• On \(d\)-Fibonacci digraphs
• scientific article; zbMATH DE number 1071742
• Fibonacci graphs
• Entropy and zeta function of the Fibonacci matrix
• Invariants of Fibonacci graphs

Cited in

(4)

• Entropy and zeta function of the Fibonacci matrix
• On \(d\)-Fibonacci digraphs
• Complexity of neural networks on Fibonacci-Cayley tree
• Infinite word factorization and signal flow graph

This page was built for publication: Fibonacci digraph and its entropy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883411)