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 Reviewe
Generally speaking, ‘almost distance-regular’ graphs are graphs that share some, but not necessarily...
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 d...
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 $\Gamma...
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 ...
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 ...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is ...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
Generally speaking, ‘almost distance-regular’ graphs are graphs that share some, but not necessarily...
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 d...
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 $\Gamma...
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 ...
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 ...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is ...
Regular and distance-regular characterizations of general graphs are well-known. In particular, the ...
Generally speaking, ‘almost distance-regular’ graphs are graphs that share some, but not necessarily...
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...