The strong spectral property for graphs
From MaRDI portal
Publication:2173323
DOI10.1016/j.laa.2020.03.031zbMath1437.05144arXiv1906.08690OpenAlexW3013243924MaRDI QIDQ2173323
Jephian C.-H. Lin, Polona Oblak, Helena Šmigoc
Publication date: 22 April 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.08690
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Structural characterization of families of graphs (05C75)
Related Items (3)
The strong spectral property of graphs: graph operations and barbell partitions ⋮ The liberation set in the inverse eigenvalue problem of a graph ⋮ On the inverse eigenvalue problem for block graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using a new zero forcing process to guarantee the strong Arnold property
- The strong Arnold property for 4-connected flat graphs
- Inverse problems in vibrations.
- The minimum rank of symmetric matrices described by a graph: a survey
- On the null space of a Colin de Verdière matrix
- Some connectivity properties for excluded minors of the graph invariant \(\nu(G)\)
- A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- The inverse eigenvalue problem of a graph: multiplicities and minors
- Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
- Zero forcing sets and the minimum rank of graphs
- A characterization of tridiagonal matrices
- The inertia set of a signed graph
- Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
- Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- Minimum number of distinct eigenvalues of graphs
This page was built for publication: The strong spectral property for graphs