2 citations · 4 across the 3 of their papers we have counts for
3 papers
math.CO2021★ 2 cited
Uniform forcing and immune sets in graphs and hypergraphs
Josep Fàbrega, Jaume Martí-Farré, Xavier Muñoz
Zero forcing is an iterative coloring process on a graph that has been widely used in such different areas as the modelling of propagation phenomena in networks and the study of mi…
math.CO2016★ 1 cited
Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity
V. Diego, J. Fàbrega, M. A. Fiol
As it is well known, the spectrum (of the adjacency matrix ) of a graph , with distinct eigenvalues other than its spectral radius , usually provides…
math.CO2012★ 1 cited
On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes
M. Cámara, J. Fàbrega, M. A. Fiol +1
The local spectrum of a vertex set in a graph has been proven to be very useful to study some of its metric properties. It also has applications in the area of pseudo-distance-regu…