55 citations · 204 across the 46 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.CO2013
Some results on the structure of multipoles in the study of snarks
M. A. Fiol, J. Vilaltella
Multipoles are the pieces we obtain by cutting some edges of a cubic graph. As a result of the cut, a multipole has dangling edges with one free end, which we call semiedges. T…
math.SP2013
An Interlacing Approach for Bounding the Sum of Laplacian Eigenvalues of Graphs
A. Abiad, M. A. Fiol, W. H. Haemers +1
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of Laplacian eigenvalues of graphs, and characterize equality. This leads to generaliza…
math.CO2013
The spectral excess theorem for distance-biregular graphs
M. A. Fiol
The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. A…