On vertex-transitive distance-regular covers of complete graphs with an extremal smallest eigenvalue

Ejemplares similares

• Non-geometric distance-regular graphs of diameter at least $3$ with smallest eigenvalue at least $-3$
  por: Koolen, Jack, et al.
  Publicado: (2023)
• A structure theory for regular graphs with fixed smallest eigenvalue
  por: Yang, Qianqian, et al.
  Publicado: (2024)
• An improved bound for strongly regular graphs with smallest eigenvalue $-m$
  por: Koolen, Jack, et al.
  Publicado: (2025)
• Note on the product of the largest and the smallest eigenvalue of a graph
  por: Abiad, Aida, et al.
  Publicado: (2024)
• On the sum of the largest and smallest eigenvalues of odd-cycle free graphs
  por: Abiad, Aida, et al.
  Publicado: (2025)