Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
Publication:4908829
DOI10.1002/jgt.21637zbMath1259.05112OpenAlexW2101880654MaRDI QIDQ4908829
Francesco Barioli, H. Tracy Hall, Hein van der Holst, Shaun M. Fallat, Pauline van den Driessche, Bryan L. Shader, Leslie Hogben, Wayne W. Barrett
Publication date: 7 March 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21637
tree-widthpath-widthminimum rankColin de Verdière type parametermaximum nullityzero forcing numberminor monotone floorminor monotone ceiling
Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Structural characterization of families of graphs (05C75) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items
Cites Work
- Mixed searching and proper-path-width
- Linearly independent vertices and minimum semidefinite rank
- Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)
- Three-connected graphs whose maximum nullity is at most three
- An upper bound for the minimum rank of a graph
- Zero forcing parameters and minimum rank problems
- The minimum rank of symmetric matrices described by a graph: a survey
- A partial k-arboretum of graphs with bounded treewidth
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width
- Graph searching and a min-max theorem for tree-width
- Graphs whose positive semi-definite matrices have nullity at most two
- Multiplicities of eigenvalues and tree-width of graphs
- A correction: Orthogonal representations and connectivity of graphs
- Orthogonal representations and connectivity of graphs
- Computation of minimal rank and path cover number for certain graphs
- Homomorphiesätze für Graphen
- Minimum-rank matrices with prescribed graph
- On the ?largeur d'arborescence?
- On the minimum rank of not necessarily symmetric matrices: A preliminary study
- The graphs for which the maximum multiplicity of an eigenvalue is two
- The Minor Crossing Number
- Nondiscriminatory propagation on trees
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- Recontamination does not help to search a graph
- Minimum Degree and Graph Minors
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- Spectral characterization of tree-width-two graphs