On d-Fibonacci digraphs

DOI10.5614/ejgta.2021.9.2.22zbMath1482.05135arXiv1909.06766OpenAlexW3207579822MaRDI QIDQ5061708

C. Dalfó, Miquel Àngel Fiol

Publication date: 14 March 2022

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.06766

zbMATH Keywords

spectrumadjacency matrixline digraphde Bruijn digraphFibonacci graph\(n\)-step Fibonacci numberdigraph on alphabet

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some properties of line digraphs
• Iterated line digraphs are asymptotically dense
• On the linegraph of a directed-graph
• Generalized Fibonacci Numbers and Associated Matrices
• Line Digraph Iterations and the (d, k) Digraph Problem
• Digraphs

This page was built for publication: On d-Fibonacci digraphs