Skip to main content

ANALISIS DE PATRONES PUNTUALES ESPACIO-TEMPORALES EN NETWORKS; MODELIZACION BAJO NO ESTACIONARIEDAD Y/O ANISOTROPIA, ESTIMACION, PREDICCION Y EVALUACION DE RIESGOS

PID2020-115442RB-I00

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2020
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD DE LLEIDA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

Repositori Obert UdL
Publication Contribución de congreso (ConferenceOutput)

Integer sequences from 𝑘-iterated line digraphs, Conference Information Technologies - Applications and Theory, ITAT 2024

  • Závacká, Dominika
  • Dalfó, Cristina
  • Miguel Ángel, Fiol
In this paper, we focus on integer sequences corresponding to the number of vertices in 𝑘-iterated line digraphs. We begin by introducing the core concepts related to digraphs. Then, we describe a method, proposed by Dalfó and Fiol, for calculating the order of 𝑘-iterated line digraphs. We explore various families of digraphs, such as De Bruijn, Kautz, Cyclic Kautz, and Square-free digraphs. To generate integer sequences representing the number of vertices in 𝑘-iterated line digraphs, we implement an algorithm that constructs induced subdigraphs by not allowing vertices containing forbidden subwords. The results include comparisons of the obtained integer sequences with those in the OEIS database and identification of new integer sequences. Our algorithm is implemented in the computational system GAP., D. Závacká’s research was partially supported by G-24-158-00 and VEGA 1/0437/23. She would like to thank her supervisor Tatiana Jajcayová for her guidance and suggestions. C. Dalfó and M. A. Fiol’s research has been supported by AGAUR from the Catalan Government under project 2021SGR00434 and MICINN from the Spanish Government under project PID2020-115442RB-I00. M. A. Fiol’s research was also supported by a grant from the Universitat Politècnica de Catalunya with references AGRUPS-2022 and AGRUPS-2023.
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Integer sequences from 𝑘-iterated line digraphs, Conference Information Technologies - Applications and Theory, ITAT 2024

  • Závacká, Dominika
  • Dalfó, Cristina
  • Miguel Ángel, Fiol
In this paper, we focus on integer sequences corresponding to the number of vertices in 𝑘-iterated line digraphs. We begin by introducing the core concepts related to digraphs. Then, we describe a method, proposed by Dalfó and Fiol, for calculating the order of 𝑘-iterated line digraphs. We explore various families of digraphs, such as De Bruijn, Kautz, Cyclic Kautz, and Square-free digraphs. To generate integer sequences representing the number of vertices in 𝑘-iterated line digraphs, we implement an algorithm that constructs induced subdigraphs by not allowing vertices containing forbidden subwords. The results include comparisons of the obtained integer sequences with those in the OEIS database and identification of new integer sequences. Our algorithm is implemented in the computational system GAP., D. Závacká’s research was partially supported by G-24-158-00 and VEGA 1/0437/23. She would like to thank her supervisor Tatiana Jajcayová for her guidance and suggestions. C. Dalfó and M. A. Fiol’s research has been supported by AGAUR from the Catalan Government under project 2021SGR00434 and MICINN from the Spanish Government under project PID2020-115442RB-I00. M. A. Fiol’s research was also supported by a grant from the Universitat Politècnica de Catalunya with references AGRUPS-2022 and AGRUPS-2023.