Eigenvalue location in graphs of small clique-width

Martin Fürer, Carlos Hoppen, David P. Jacobs, Vilmar Trevisan

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


Finding a diagonal matrix congruent to A−cI for constants c, where A is the adjacency matrix of a graph G allows us to quickly tell the number of eigenvalues in a given interval. If G has clique-width k and a corresponding k-expression is known, then diagonalization can be done in time O(poly(k)n) where n is the order of G.

Original languageEnglish (US)
Pages (from-to)56-85
Number of pages30
JournalLinear Algebra and Its Applications
StatePublished - Jan 1 2019

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory
  • Numerical Analysis
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Eigenvalue location in graphs of small clique-width'. Together they form a unique fingerprint.

Cite this