Ponències/Comunicacions de congressos
Recent Submissions
-
Some results on the laplacian spectra of Token graphs
(Springer, 2021)
Conference report
Restricted access - publisher's policyWe 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 -
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 ... -
Online graph coloring with advice and randomized adversary
(Springer, 2016)
Conference report
Restricted access - publisher's policyWe generalize the model of online computation with three players (algorithm, adversary and an oracle called advisor) by strength- ening the power of the adversary by randomization. In our generalized model, the advisor ... -
Genera Esfera: Interacting with a trackball mapped onto a sphere to explore generative visual worlds
(2016)
Conference report
Open AccessGenera Esfera is an interactive installation that allows the audience to interact and easily become a VJ (visual DJ) in a world of generative visuals. It is an animated and generative graphic environment with a music ... -
A geometric approach to dense Cayley digraphs of finite Abelian groups
(Elsevier, 2016)
Conference report
Open AccessWe give a method for constructing infinite families of dense (or eventually likely dense) Cayley digraphs of finite Abelian groups. The diameter of the digraphs is obtained by means of the related {\em minimum distance ... -
Digraphs with walks of equal length between vertices
(1984)
Conference report
Open Access -
Classifing stars: a comparison between clasical, genetic and neural network algorithms
(F. MURTAGH AND A. HECK, 1992)
Conference report
Open Access
RSS 1.0