Add to ORKGThis thesis is an exposition of a paper entitled An odd characterization of the gen- eralized odd graphs by Edwin R. Van Dam and Willem H. Haemers. The Spectral Excess Theorem states that a connected graph {u100000} is distance-regular if the average excess of {u100000} is equal to its spectral excess. This theorem was proven by Fiol and Garriaga in 1997. In this paper we use the Spectral Excess Theorem to show that any connected k-regular graph with d + 1 distinct eigenvalues and odd-girth 2d + 1 is distance-regular
Generally speaking, ‘almost distance-regular’ graphs are graphs that share some, but not necessarily...
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graphs;generalized odd graphs...
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...
Recently, it has been shown that a connected graph Γ with d+1 distinct eigenvalues and odd-girth 2d+...
AbstractWe show that any connected regular graph with d+1 distinct eigenvalues and odd-girth 2d+1 is...
AbstractThe spectral excess theorem provides a quasi-spectral characterization for a (regular) graph...
AbstractWe show that any connected regular graph with d+1 distinct eigenvalues and odd-girth 2d+1 is...
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...
We show that any connected regular graph with d + 1 distinct eigenvalues and odd-girth 2d + 1 is dis...
* distance-regularity; * local spectra; * predistance polynomials; * the spectral excess...
The Spectral Excess Theorem provides a quasi-spectral characterization for a (regular) graph $\Gamma...
Generally speaking, ‘almost distance-regular’ graphs are graphs that share some, but not necessarily...
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graphs;generalized odd graphs...
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...
Recently, it has been shown that a connected graph Γ with d+1 distinct eigenvalues and odd-girth 2d+...
AbstractWe show that any connected regular graph with d+1 distinct eigenvalues and odd-girth 2d+1 is...
AbstractThe spectral excess theorem provides a quasi-spectral characterization for a (regular) graph...
AbstractWe show that any connected regular graph with d+1 distinct eigenvalues and odd-girth 2d+1 is...
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...
We show that any connected regular graph with d + 1 distinct eigenvalues and odd-girth 2d + 1 is dis...
* distance-regularity; * local spectra; * predistance polynomials; * the spectral excess...
The Spectral Excess Theorem provides a quasi-spectral characterization for a (regular) graph $\Gamma...
Generally speaking, ‘almost distance-regular’ graphs are graphs that share some, but not necessarily...
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graphs;generalized odd graphs...
The final publication is available at Springer via http://dx.doi.org/10.1007/s10801-015-0654-6Let Ga...