Positive semidefinite zero forcing

DOI10.1016/j.laa.2013.05.020zbMath1283.05165OpenAlexW2155115013MaRDI QIDQ2435453

Yanyan Li

Publication date: 19 February 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2013.05.020

zbMATH Keywords

positive semidefiniteminimum rankmaximum nullityzero forcing number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (25)

Nordhaus-Gaddum problems for power domination ⋮ Computational approaches for zero forcing and related problems ⋮ Positive Semidefinite Zero Forcing: Complexity and Lower Bounds ⋮ Failed skew zero forcing on a graph ⋮ Upper bounds for positive semidefinite propagation time ⋮ Compressed cliques graphs, clique coverings and positive zero forcing ⋮ Orthogonal representations of Steiner triple system incidence graphs ⋮ The Complexity of the Positive Semidefinite Zero Forcing ⋮ An integer program for positive semidefinite zero forcing in graphs ⋮ Positive semidefinite propagation time ⋮ Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph ⋮ Graphs of unitary matrices and positive semidefinite zero forcing ⋮ Positive Zero Forcing and Edge Clique Coverings ⋮ A New Lower Bound for Positive Zero Forcing ⋮ Properties of a \(q\)-analogue of zero forcing ⋮ The zero forcing polynomial of a graph ⋮ Lower bounds for positive semidefinite zero forcing and their applications ⋮ Complexity and computation of connected zero forcing ⋮ On the relationships between zero forcing numbers and certain graph coverings ⋮ Odd Cycle Zero Forcing Parameters and the Minimum Rank of Graph Blowups ⋮ On the complexity of the positive semidefinite zero forcing number ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ Connected zero forcing sets and connected propagation time of graphs ⋮ Line graphs: Their maximum nullities and zero forcing numbers ⋮ Positive semidefinite zero forcing numbers of two classes of graphs

Cites Work

• Unnamed Item
• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• On the graph complement conjecture for minimum rank
• On the graph complement conjecture for minimum semidefinite rank
• Linearly independent vertices and minimum semidefinite rank
• Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
• Zero forcing parameters and minimum rank problems
• Lower bounds in minimum rank problems
• Graphs whose positive semi-definite matrices have nullity at most two
• Zero forcing sets and the minimum rank of graphs
• Minimum-rank matrices with prescribed graph
• Minimum semidefinite rank of outerplanar graphs and the tree cover number
• Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
• On the maximum positive semi-definite nullity and the cycle matroid of graphs
• Minimum rank of edge subdivisions of graphs
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• Graphs whose minimal rank is two

This page was built for publication: Positive semidefinite zero forcing