The inertia set of a signed graph
From MaRDI portal
Publication:2637138
DOI10.1016/j.laa.2013.04.032zbMath1282.05058arXiv1208.5285MaRDI QIDQ2637138
Hein van der Holst, Frank J. Hall, Marina Arav, Zhongshan Li
Publication date: 19 February 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.5285
Related Items
Signed graphs with maximum nullity two, Using a new zero forcing process to guarantee the strong Arnold property, Signed graphs whose signed Colin de Verdière parameter is two, Signed graphs with stable maximum nullity at most two, The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph, The strong spectral property for graphs, Two-connected signed graphs with maximum nullity at most two, Global rigidity of triangulations with braces, Zero forcing for sign patterns, The extremal problems on the inertia of weighted bicyclic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
- Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)
- The minimum rank of symmetric matrices described by a graph: a survey
- Signed graphs
- Multiplicities of eigenvalues and tree-width of graphs
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- Graphs with magnetic Schrödinger operators of low corank
- The maximum corank of graphs with a 2-separation
- Determination of the inertia of a partitioned Hermitian matrix
- A characterization of tridiagonal matrices
- A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
- Graphs whose minimal rank is two
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- Spectral characterization of tree-width-two graphs
