Ponències/Comunicacions de congressos
Enviaments recents
-
Some results on the laplacian spectra of Token graphs
(Springer, 2021)
Text en actes de congrés
Accés obertWe study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The k-token graph Fk(G) of a graph G is the graph whose vertices are the k-subsets of vertices from G, two of which being adjacent ... -
Graph centralities and cascading failures in networks
(2019)
Text en actes de congrés
Accés restringit per política de l'editorial -
Identifying codes from the spectrum of a graph or digraph
(LaBRI, 2019)
Text en actes de congrés
Accés obert -
On identifying codes in line digraphs
(2019)
Text en actes de congrés
Accés obert -
Sediment
(2018)
Text en actes de congrés
Accés restringit per política de l'editorialSediment is a series of abstract narrations which combine the generative visuals of Lali Barrière with the static music of Ferran Fages, with a clearly minimalist approach. The visuals use a single graphic element: the ... -
Teaching mathematics and physics for animation in processing
(Tessellations Publishing, 2018)
Text en actes de congrés
Accés restringit per política de l'editorialThis paper describes my teaching experience with first year undergraduate students, at the Centre de la Imatge i la Tecnologia Multimèdia (CITM), in Terrassa, a city near Barcelona (Catalonia) during the Fall 2017 semester. ... -
Grafos y teselaciones del plano
(Universidad de Zaragoza (UZA), 1984)
Comunicació de congrés
Accés obert -
Combinatorics in the Art of the Twentieth Century
(2017)
Text en actes de congrés
Accés obertThis paper is motivated by a question I asked myself: How can combinatorial structures be used in a work of art? Immediately, other questions arose: Whether there are artists that work or think combinatorially? If so, what ... -
Characterizing path-like trees from linear configurations
(2017)
Comunicació de congrés
Accés obertAssume that we embed the path Pn as a subgraph of a 2-dimensional grid, namely, Pk¿Pl. Given such an embedding, we consider the ordered set of subpaths L1, L2,...,Lm which are maximal straight segments in the embedding, ... -
Characterizing identifying codes through the spectrum of a graph or digraph
(2017)
Text en actes de congrés
Accés obert -
Locating-dominating partitions in graphs
(2016)
Text en actes de congrés
Accés obertLet G = (V, E) be a connected graph of order n. Let ¿ = {S1, . . . , Sk} be a partition of V . Let r(u|¿) denote the vector of distances between a vertex v ¿ V and the elements of ¿, that is, r(v, ¿) = (d(v, S1), . . . ... -
On the spectra of Markov matrices for weighted Sierpinski graphs
(2016)
Text en actes de congrés
Accés obertRelevant information from networked systems can be obtained by analyzing the spectra of matrices associated to their graph representations. In particular, the eigenvalues and eigenvectors of the Markov matrix and related ...