The Spectral Excess Theorem provides a quasi-spectral characterization for a (regular) graph $\Gamma$ with $d+1$ different eigenvalues to be distance-regular graph, in terms of the mean (d-1)-excess of its vertices.\ The original approach, due to Fiol and Garriga in $1997$, was obtained in a wide context from a local point of view, so giving a characterization of the so-called pseudo-distance-regularity around a vertex.\ In this paper we present a new simple method based in a global point of view, and where the mean degree of the distance-$d$ graph $\Gamma_d$ plays an essential role
This thesis is an exposition of a paper entitled An odd characterization of the gen- eralized odd gr...
Let G be a distance-regular graph with diameter d and Kneser graph K=Gd, the distance-d graph of G. ...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
AbstractThe spectral excess theorem provides a quasi-spectral characterization for a (regular) graph...
The spectral excess theorem provides a quasi-spectral characterization for a (regular) graph Γ with ...
The spectral excess theorem provides a quasi-spectral characterization for a (regular) graph Γ with ...
We study regular graphs whose distance-2 graph or distance-1-or-2 graph is strongly regular. We prov...
We study regular graphs whose distance-2 graph or distance-1-or-2 graph is strongly regular. We prov...
The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is ...
The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is d...
Given a regular (connected) graph G=(X,E) with adjacency matrix A, d+1 distinct eigenvalues, and dia...
The final publication is available at Springer via http://dx.doi.org/10.1007/s10801-015-0654-6Let Ga...
Generally speaking, ‘almost distance-regular’ graphs are graphs that share some, but not necessarily...
The final publication is available at Springer via http://dx.doi.org/10.1007/s10801-015-0654-6Let Ga...
This thesis is an exposition of a paper entitled An odd characterization of the gen- eralized odd gr...
This thesis is an exposition of a paper entitled An odd characterization of the gen- eralized odd gr...
Let G be a distance-regular graph with diameter d and Kneser graph K=Gd, the distance-d graph of G. ...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
AbstractThe spectral excess theorem provides a quasi-spectral characterization for a (regular) graph...
The spectral excess theorem provides a quasi-spectral characterization for a (regular) graph Γ with ...
The spectral excess theorem provides a quasi-spectral characterization for a (regular) graph Γ with ...
We study regular graphs whose distance-2 graph or distance-1-or-2 graph is strongly regular. We prov...
We study regular graphs whose distance-2 graph or distance-1-or-2 graph is strongly regular. We prov...
The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is ...
The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is d...
Given a regular (connected) graph G=(X,E) with adjacency matrix A, d+1 distinct eigenvalues, and dia...
The final publication is available at Springer via http://dx.doi.org/10.1007/s10801-015-0654-6Let Ga...
Generally speaking, ‘almost distance-regular’ graphs are graphs that share some, but not necessarily...
The final publication is available at Springer via http://dx.doi.org/10.1007/s10801-015-0654-6Let Ga...
This thesis is an exposition of a paper entitled An odd characterization of the gen- eralized odd gr...
This thesis is an exposition of a paper entitled An odd characterization of the gen- eralized odd gr...
Let G be a distance-regular graph with diameter d and Kneser graph K=Gd, the distance-d graph of G. ...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...