Skip to main content

and
  1. No Access

    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...

    Tayuan Huang, Chao-Rong Liu in Graphs and Combinatorics (1999)