On d-Fibonacci digraphs
| Autor: | Miguel Angel Fiol, Cristina Dalfó |
|---|---|
| Přispěvatelé: | Universitat Politècnica de Catalunya. Departament de Matemàtiques, Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
Fibonacci number
Digraph on alphabet Combinatorics De bruijn digraph Spectrum QA1-939 FOS: Mathematics n-step Fibonacci number Mathematics - Combinatorics Discrete Mathematics and Combinatorics Adjacency matrix Number Theory (math.NT) de Bruijn digraph Mathematics Mathematics::Combinatorics Mathematics - Number Theory Grafs Teoria de Applied Mathematics Spectrum (functional analysis) Line digraph Fibonacci graph Graph theory n-step fibonacci number fibonacci graph digraph on alphabet de bruijn digraph line digraph adjacency matrix spectrum Iterated function 05C20 05C50 11B39 Line (geometry) Computer Science::Programming Languages Combinatorics (math.CO) 05 Combinatorics::05C Graph theory [Classificació AMS] Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs [Àrees temàtiques de la UPC] MathematicsofComputing_DISCRETEMATHEMATICS |
| Zdroj: | Electronic Journal of Graph Theory and Applications Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 527-538 (2021) Repositorio Abierto de la UdL Universitad de Lleida UPCommons. Portal del coneixement obert de la UPC Universitat Politècnica de Catalunya (UPC) |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|