Add to ORKGThe 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 bipartite graphPeer ReviewedPostprint (published version
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 ...
The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is d...
The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is ...
The final publication is available at Springer via http://dx.doi.org/10.1007/s10801-015-0654-6Let Ga...
AbstractGenerally speaking, ‘almost distance-regular’ graphs share some, but not necessarily all, of...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
This is an Accepted Manuscript of an article published by Taylor & Francis Group in Linear and ...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
We study regular graphs whose distance-2 graph or distance-1-or-2 graph is strongly regular. We prov...
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 ...
The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is d...
The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is ...
The final publication is available at Springer via http://dx.doi.org/10.1007/s10801-015-0654-6Let Ga...
AbstractGenerally speaking, ‘almost distance-regular’ graphs share some, but not necessarily all, of...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
This is an Accepted Manuscript of an article published by Taylor & Francis Group in Linear and ...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
We study regular graphs whose distance-2 graph or distance-1-or-2 graph is strongly regular. We prov...
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 ...