dc.contributor.author
Dalfó, Cristina
dc.contributor.author
Fiol Mora, Miguel Ángel
dc.date.accessioned
2024-12-05T21:37:05Z
dc.date.available
2024-12-05T21:37:05Z
dc.date.issued
2021-11-12T13:32:56Z
dc.date.issued
2021-11-12T13:32:56Z
dc.date.issued
2021-11-12T13:32:56Z
dc.identifier
https://doi.org/10.5614/ejgta.2021.9.2.22
dc.identifier
http://hdl.handle.net/10459.1/72285
dc.identifier.uri
https://hdl.handle.net/10459.1/72285
dc.description.abstract
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.
dc.description.abstract
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.
dc.format
application/pdf
dc.publisher
Institut Teknologi Bandung (ITB) Indonesia
dc.publisher
Indonesian Combinatorial Society (InaCombS)
dc.publisher
GTA Research Group, University of Newcastle (Australia)
dc.relation
Reproducció del document publicat a: https://doi.org/10.5614/ejgta.2021.9.2.22
dc.relation
Electronic Journal of Graph Theory and Applications, 2021, vol. 9, num. 2, p. 527-538
dc.relation
info:eu-repo/grantAgreement/EC/H2020/734922/EU/CONNECT
dc.rights
cc-by-sa (c) Dalfó et al., 2021
dc.rights
info:eu-repo/semantics/openAccess
dc.source
https://creativecommons.org/licenses/by-sa/4.0/
dc.subject
n-step Fibonacci number
dc.subject
Fibonacci graph
dc.subject
Digraph on alphabet
dc.subject
de Bruijn digraph
dc.subject
Adjacency matrix
dc.title
On d-Fibonacci digraphs
dc.type
info:eu-repo/semantics/article
dc.type
info:eu-repo/semantics/publishedVersion
