Forbidden minors for the class of graphs G with (G) 2
DOI10.1016/J.LAA.2006.08.003zbMATH Open1118.05064OpenAlexW1974791842MaRDI QIDQ876301FDOQ876301
Authors: Leslie Hogben, Hein van der Holst
Publication date: 18 April 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2006.08.003
Recommendations
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- Graphs whose minimal rank is two
- Zero forcing sets and the minimum rank of graphs
- The minimum rank of symmetric matrices described by a graph: a survey
- The inverse eigenvalue and inertia problems for minimum rank two graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph minors (05C83) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Computation of minimal rank and path cover number for certain graphs
- Multiplicities of eigenvalues and tree-width of graphs
- Title not available (Why is that?)
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- Graphs whose minimal rank is two
- Title not available (Why is that?)
Cited In (19)
- Signed graphs with stable maximum nullity at most two
- On the minimum rank of the third power of a starlike tree
- Forbidden minors to graphs with small feedback sets
- Orthogonal representations, minimum rank, and graph complements
- Three-connected graphs whose maximum nullity is at most three
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
- Using a new zero forcing process to guarantee the strong Arnold property
- Two-connected signed graphs with maximum nullity at most two
- On the Wiener index, distance cospectrality and transmission-regular graphs
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- The minimum rank of matrices and the equivalence class graph
- How to count \(k\)-paths
- Techniques for determining the minimum rank of a small graph
- Zero forcing sets and the minimum rank of graphs
- Minimum rank of skew-symmetric matrices described by a graph
- The minimum rank of symmetric matrices described by a graph: a survey
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Some bounds on the zero forcing number of a graph
- The inertia set of a signed graph
This page was built for publication: Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876301)