Three-connected graphs whose maximum nullity is at most three
From MaRDI portal
Publication:929488
DOI10.1016/j.laa.2008.03.018zbMath1145.05037MaRDI QIDQ929488
Publication date: 17 June 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2008.03.018
graph minor; symmetric matrix; tree width; minimum rank; strong Arnold property; nullity 3; partial tree
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C83: Graph minors
15A03: Vector spaces, linear dependence, rank, lineability
Related Items
Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph, On the graph complement conjecture for minimum rank, Computing inertia sets using atoms, The minimum semidefinite rank of the complement of partial \(k\)-trees, Maximum generic nullity of a graph, Maximum nullity of outerplanar graphs and the path cover number, On minimum rank and zero forcing sets of a graph, Expected values of parameters associated with the minimum rank of a graph, Lower bounds in minimum rank problems, Zero forcing sets and the minimum rank of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)
- Forbidden minors characterization of partial 3-trees
- Multiplicities of eigenvalues and tree-width of graphs
- A correction: Orthogonal representations and connectivity of graphs
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- Orthogonal representations and connectivity of graphs
- A characterization of tridiagonal matrices
- Graphs whose minimal rank is two
- On Linear Recognition of Tree-Width at Most Four
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth