Eigenvalue location in graphs of small clique-width
From MaRDI portal
Publication:1625480
DOI10.1016/j.laa.2018.09.015zbMath1402.05136arXiv1710.09510OpenAlexW2964124935MaRDI QIDQ1625480
Vilmar Trevisan, Carlos Hoppen, David P. Jacobs, Martin Fuerer
Publication date: 29 November 2018
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.09510
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eigenvalue location for chain graphs
- Locating the eigenvalues of trees
- Spectral distributions of adjacency and Laplacian matrices of random graphs
- Sparse regular random graphs: spectral density and eigenvectors
- Some spectral properties of cographs
- Recent developments on graphs of bounded clique-width
- On certain eigenspaces of cographs
- On nested split graphs whose second largest eigenvalue is less than 1
- On the structure of node-label-controlled graph languages
- Restrictions, extensions, and variations of NLC grammars
- Complement reducible graphs
- The expected eigenvalue distribution of a large regular graph
- \(k\)-NLC graphs and polynomial algorithms
- The rank of a cograph
- Eigenvalue location in cographs
- Upper bounds to the clique width of graphs
- Locating the eigenvalues for graphs of small clique-width
- Handle-rewriting hypergraph grammars
- Eigenvalue location in threshold graphs
- Diffusion maps
- Clique-width minimization is NP-hard
- Graph minors. II. Algorithmic aspects of tree-width
- On the Relationship Between Clique-Width and Treewidth
