activity
20122024
most citedOn almost distance-regular graphs

55 citations · 204 across the 46 of their papers we have counts for

collaborators
Showing 2014Show all

5 papers · 1 filter

math.CO2014

Comments on "Extremal Cayley digraphs of finite Abelian groups" [Intercon. Networks 12 (2011), no. 1-2, 125--135]

M. A. Fiol

We comment on the paper "Extremal Cayley digraphs of finite Abelian groups" [Intercon. Networks 12 (2011), no. 1-2, 125--135]. In particular, we give some counterexamples to the re…

math.CO2014

The spectral excess theorem for distance-regular graphs having distance- graph with fewer distinct eigenvalues

M. A. Fiol

Let be a distance-regular graph with diameter and Kneser graph , the distance- graph of . We say that is partially antipodal when has fewer distinct ei…

math.CO2014★ 1 cited

A spectral characterization of strongly distance-regular graphs with diameter four

M. A. Fiol

A graph with distinct eigenvalues is called strongly distance-regular if itself is distance-regular, and its distance- graph is strongly-regular. In this not…

math.CO2014★ 5 cited

The Laplacian spectral excess theorem for distance-regular graphs

Edwin R. van Dam, Miquel Angel Fiol

The spectral excess theorem states that, in a regular graph G, the average excess, which is the mean of the numbers of vertices at maximum distance from a vertex, is bounded above…

math.CO2014★ 5 cited

Some Spectral and Quasi-Spectral Characterizations of Distance-Regular Graphs

A. Abiad, E. R. van Dam, M. A. Fiol

In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the i…