Signed graphs with stable maximum nullity at most two
From MaRDI portal
Publication:2020682
DOI10.1016/J.LAA.2021.02.017zbMATH Open1462.05162OpenAlexW3134871789MaRDI QIDQ2020682FDOQ2020682
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
Recommendations
- Two-connected signed graphs with maximum nullity at most two
- Signed graphs with maximum nullity two
- Further results on the nullity of signed graphs
- A characterization of bicyclic signed graphs with nullity \(n-7\)
- On mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Signed graphs
- Zero forcing sets and the minimum rank of graphs
- Title not available (Why is that?)
- The inertia set of a signed graph
- The graphs for which the maximum multiplicity of an eigenvalue is two
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- Maximum nullity of outerplanar graphs and the path cover number
- On the Strong Arnol'd Hypothesis and the connectivity of graphs
- Two-connected signed graphs with maximum nullity at most two
Cited In (5)
This page was built for publication: Signed graphs with stable maximum nullity at most two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020682)
