Signed graphs with stable maximum nullity at most two
From MaRDI portal
Publication:2020682
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
Cites work
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- 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\)
- Maximum nullity of outerplanar graphs and the path cover number
- On the strong Arnol'd hypothesis and the connectivity of graphs
- Signed graphs
- The graphs for which the maximum multiplicity of an eigenvalue is two
- The inertia set of a signed graph
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- Two-connected signed graphs with maximum nullity at most two
- Zero forcing sets and the minimum rank of graphs
Cited in
(11)- The inertia set of a signed graph
- On the strong Arnol'd hypothesis and the connectivity of graphs
- Signed graphs with maximum nullity two
- Signed graphs with maximal index
- The strong Arnold property for 4-connected flat graphs
- Two-connected signed graphs with maximum nullity at most two
- Using a new zero forcing process to guarantee the strong Arnold property
- No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
- Further results on the nullity of signed graphs
- On mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphs
- Signed graphs whose signed Colin de Verdière parameter is two
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)