2026-04-14T04:08:52Zhttps://recercat.cat/oai/requestoai:recercat.cat:10459.1/722852024-12-05T21:37:05Zcom_2072_3622col_2072_479130
On d-Fibonacci digraphs
Dalfó, Cristina
Fiol Mora, Miguel Ángel
n-step Fibonacci number
Fibonacci graph
Digraph on alphabet
de Bruijn digraph
Line digraph
Adjacency matrix
Spectrum
The d-Fibonacci digraphs F(d, k), introduced here, have the number of vertices following some generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs. Here we study some of their nice properties. For instance, F(d, k) has diameter d + k − 2 and is semi-pancyclic; that is, it has a cycle of every length between 1 and ℓ, with ℓ ∈ {2k − 2, 2k − 1}. Moreover, it turns out that several other numbers of F(d, k) (of closed l-walks, classes of vertices, etc.) also follow the same linear recurrences as the numbers of vertices of the d-Fibonacci digraphs.
The research of the first author has also received funding from the European Union’s Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement
No 734922.
2021-11-12T13:32:56Z
2021-11-12T13:32:56Z
2021
2021-11-12T13:32:56Z
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
https://doi.org/10.5614/ejgta.2021.9.2.22
2338-2287
http://hdl.handle.net/10459.1/72285
http://hdl.handle.net/10459.1/72285
eng
Reproducció del document publicat a: https://doi.org/10.5614/ejgta.2021.9.2.22
Electronic Journal of Graph Theory and Applications, 2021, vol. 9, num. 2, p. 527-538
info:eu-repo/grantAgreement/EC/H2020/734922/EU/CONNECT
cc-by-sa (c) Dalfó et al., 2021
info:eu-repo/semantics/openAccess
application/pdf
Institut Teknologi Bandung (ITB) Indonesia
Indonesian Combinatorial Society (InaCombS)
GTA Research Group, University of Newcastle (Australia)
https://creativecommons.org/licenses/by-sa/4.0/