activity
20202025
most citedA general method to find the spectrum and eigenspaces of the -token of a cycle, and 2-token through continuous fractions

1 citations · 1 across the 8 of their papers we have counts for

collaborators

9 papers

math.CO2025

There are no excess one digraphs

Slobodan Filipovski, Arnau Messegué, Josep M. Miret +1

A digraph is \emph{-geodetic} if for any pair there is at most one -walk of length not exceeding . The order of a -geodetic digraph with minimum ou…

math.CO2024

On the nonexistence of almost Moore digraphs with self-repeats

Arnau Messegué, Josep Maria Miret

An almost Moore digraph is a diregular digraph of degree , diameter and order . Their existence has only been shown for . It has also been conje…

math.CO2024★ 1 cited

A general method to find the spectrum and eigenspaces of the -token of a cycle, and 2-token through continuous fractions

M. A. Reyes, C. Dalfó, M. A. Fiol +1

The -token graph of a graph is the graph whose vertices are the -subsets of vertices from , two of which being adjacent whenever their symmetric difference is…

math.CO2023

Some bounds on the Laplacian eigenvalues of token graphs

Cristina Dalfó, Miquel Àngel Fiol, Arnau Messegué

The -token graph of a graph on vertices is the graph whose vertices are the -subsets of vertices from , two of which being adjacent wheneve…

math.CO2023

On the spectra of token graphs of cycles and other graphs

Mónica. A. Reyes, Cristina Dalfó, Miquel Àngel Fiol +1

The -token graph of a graph is the graph whose vertices are the -subsets of vertices from , two of which being adjacent whenever their symmetric difference is…

math.CO2023

On large regular (1,1,k)-mixed graphs

C. Dalfó, G. Erskine, G. Exoo +4

An -mixed graph has every vertex with undirected degree , directed in- and out-degree , and diameter . In this paper, we study the case , proposing som…

math.CO2023

The Diameter of Sum Basic Equilibria Games

Aida Abiad, Carme Alvarez, Arnau Messegué

A graph of order is said to be a sum basic equilibrium if and only if for every edge from and any node from , when performing the swap of the edge for…

cs.GT2023

Computing a Best Response against a Maximum Disruption Attack

Carme Àlvarez, Arnau Messegué

Inspired by scenarios where the strategic network design and defense or immunisation are of the central importance, Goyal et al. [3] defined a new Network Formation Game with Attac…

cs.GT2020

New Insights into the Structure of Equilibria for the Network Creation Game

Carme Àlvarez, Arnau Messegué

We study the sum classic network creation game introduced by Fabrikant et al. in which players conform a network buying links at individual price . When studying this model…