Signed graphs with stable maximum nullity at most two
From MaRDI portal
Publication:2020682
DOI10.1016/j.laa.2021.02.017zbMath1462.05162OpenAlexW3134871789MaRDI QIDQ2020682
F. Scott Dahlgren, Hein van der Holst, Marina Arav
Publication date: 24 April 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2021.02.017
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03) Signed and weighted graphs (05C22)
Related Items (1)
Cites Work
- Unnamed Item
- Maximum nullity of outerplanar graphs and the path cover number
- Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)
- Signed graphs
- Two-connected signed graphs with maximum nullity at most two
- Zero forcing sets and the minimum rank of graphs
- The inertia set of a signed graph
- On the Strong Arnol'd Hypothesis and the connectivity of graphs
- The graphs for which the maximum multiplicity of an eigenvalue is two
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
This page was built for publication: Signed graphs with stable maximum nullity at most two