On d-Fibonacci digraphs
| dc.contributor.author | Dalfó Simó, Cristina |
| dc.contributor.author | Fiol Mora, Miquel Àngel |
| dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
| dc.date.accessioned | 2021-11-24T10:52:13Z |
| dc.date.available | 2021-11-24T10:52:13Z |
| dc.date.issued | 2021-10-03 |
| 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 l, with l ¿ {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.peerreviewed | Peer Reviewed |
| dc.description.sponsorship | This research has been partially supported by AGAUR from the Catalan Government under project 2017SGR1087 and by MICINN from the Spanish Government under project PGC2018-095471-B-I00. The research of the first author has also been supported by MICINN from the Spanish Government under project MTM2017-83271-R. 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 lodowska-Curie grant agreement No 734922. |
| dc.description.version | Postprint (published version) |
| dc.format.extent | 12 p. |
| dc.identifier.citation | Dalfo, C.; Fiol, M. On d-Fibonacci digraphs. "Electronic journal of graph theory and applications", 3 Octubre 2021, vol. 9, núm. 2, p. 527-538. |
| dc.identifier.doi | 10.5614/ejgta.2021.9.2.22 |
| dc.identifier.issn | 2338-2287 |
| dc.identifier.uri | https://hdl.handle.net/2117/357037 |
| dc.language.iso | eng |
| dc.relation.projectid | info:eu-repo/grantAgreement/EC/H2020/734922/EU/Combinatorics of Networks and Computation/CONNECT |
| dc.relation.publisherversion | https://www.ejgta.org/index.php/ejgta/article/view/1166 |
| dc.rights.access | Open Access |
| dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
| dc.subject.ams | Classificació AMS::05 Combinatorics::05C Graph theory |
| dc.subject.lcsh | Graph theory |
| dc.subject.lemac | Grafs, Teoria de |
| dc.subject.other | N-step Fibonacci number |
| dc.subject.other | Fibonacci graph |
| dc.subject.other | Digraph on alphabet |
| dc.subject.other | De Bruijn digraph |
| dc.subject.other | Line digraph |
| dc.subject.other | Adjacency matrix |
| dc.subject.other | Spectrum |
| dc.title | On d-Fibonacci digraphs |
| dc.type | Article |
| dspace.entity.type | Publication |
| local.citation.author | Dalfo, C.; Fiol, M. |
| local.citation.endingPage | 538 |
| local.citation.number | 2 |
| local.citation.publicationName | Electronic journal of graph theory and applications |
| local.citation.startingPage | 527 |
| local.citation.volume | 9 |
| local.identifier.drac | 32151331 |
Fitxers
Paquet original
1 - 1 de 1
Carregant...
- Nom:
- Fibonacci(28juliol2020)-REV28sep2021.pdf
- Mida:
- 318.17 KB
- Format:
- Adobe Portable Document Format
- Descripció:
- Article principal