The minimum number of distinct eigenvalues of a threshold graph is at most $4$

Documenti analoghi

• On the minimum number of eigenvalues of trees of diameter seven
  di: Allem, Luiz Emilio, et al.
  Pubblicazione: (2025)
• On the minimum number of eigenvalues of matrices associated with cographs
  di: Allem, Luiz Emilio, et al.
  Pubblicazione: (2026)
• Multi-Community Spectral Clustering for Geometric Graphs
  di: Allem, Luiz Emilio, et al.
  Pubblicazione: (2025)
• On the minimum number of distinct eigenvalues of triangle-free strongly regular graphs
  di: Egolf, Emily, et al.
  Pubblicazione: (2025)
• Hermitian adjacency matrices with at most three distinct eigenvalues
  di: Akbari, Saieed, et al.
  Pubblicazione: (2025)