Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Spectral Characterization of Some Generalized Odd Graphs
Suppose G is a connected, k-regular graph such that Spec(G)=Spec(Γ) where Γ is a distance-regular graph of diameter d with parameters a 1=a 2=⋯=a d−1=0 and a d>0; i.e., a generalized odd graph, we show that G mu...