Forbidden minors for the class of graphs G with (G) 2

DOI10.1016/J.LAA.2006.08.003MaRDI QIDQ876301zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Symmetric matrixCorankGraph minorMinimum rankStrong Arnold property

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph minors (05C83) Vector spaces, linear dependence, rank, lineability (15A03)

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

Cites work

• scientific article; zbMATH DE number 1303522 (Why is no real title available?)
• scientific article; zbMATH DE number 475583 (Why is no real title available?)
• A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
• Computation of minimal rank and path cover number for certain graphs
• Graphs whose minimal rank is two
• Multiplicities of eigenvalues and tree-width of graphs

Cited in

(19)

• The inertia set of a signed graph
• Two-connected signed graphs with maximum nullity at most two
• On the minimum rank of the third power of a starlike tree
• How to count \(k\)-paths
• Minimum rank of skew-symmetric matrices described by a graph
• Techniques for determining the minimum rank of a small graph
• The minimum rank of matrices and the equivalence class graph
• Zero forcing sets and the minimum rank of graphs
• Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
• The minimum rank of symmetric matrices described by a graph: a survey
• Using a new zero forcing process to guarantee the strong Arnold property
• Some bounds on the zero forcing number of a graph
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• On the Wiener index, distance cospectrality and transmission-regular graphs
• Orthogonal representations, minimum rank, and graph complements
• Signed graphs with stable maximum nullity at most two
• A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
• Three-connected graphs whose maximum nullity is at most three
• Forbidden minors to graphs with small feedback sets

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)