7 citations · 7 across the 5 of their papers we have counts for
5 papers · 1 filter
The (Δ,D) and (Δ,N) problems for New Amsterdam and Manhattan digraphs
C. Dalfó, M. A. Fiol
We give a quasi-complete solution of the (Δ,N) problem for two well-known families of digraphs used as good models for large interconnection networks. In our study we also relate b…
Edge-distance-regular graphs are distance-regular
M. Cámara, C. Dalfó, C. Delorme +2
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give s…
A differential approach for bounding the index of graphs under perturbations
C. Dalfó, M. A. Fiol, E. Garriga
This paper presents bounds for the variation of the spectral radius of a graph after some perturbations or local vertex/edge modifications of . The perturbations cons…
Moments in graphs
C. Dalfó, M. A. Fiol, E. Garriga
Let be a connected graph with vertex set and a {\em weight function} that assigns a nonnegative number to each of its vertices. Then, the {\em -moment} of at ver…
Dual concepts of almost distance-regularity and the spectral excess theorem
Cristina Dalfó, Edwin R. van Dam, Miquel Angel Fiol +1
Generally speaking, `almost distance-regular' graphs share some, but not necessarily all, of the regularity properties that characterize distance-regular graphs. In this paper we p…