Ponències/Comunicacions de congressos
Recent Submissions
-
Some results on the laplacian spectra of Token graphs
(Springer, 2021)
Conference report
Open AccessWe 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)
Conference report
Restricted access - publisher's policy -
Identifying codes from the spectrum of a graph or digraph
(LaBRI, 2019)
Conference report
Open Access -
On identifying codes in line digraphs
(2019)
Conference report
Open Access -
Sediment
(2018)
Conference report
Restricted access - publisher's policySediment 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)
Conference report
Restricted access - publisher's policyThis 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)
Conference lecture
Open Access -
Combinatorics in the Art of the Twentieth Century
(2017)
Conference report
Open AccessThis 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)
Conference lecture
Open AccessAssume 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)
Conference report
Open Access -
Locating-dominating partitions in graphs
(2016)
Conference report
Open AccessLet 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)
Conference report
Open AccessRelevant 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 ...
RSS 1.0