Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees

DOI10.13001/1081-3810.1506zbMath1252.05118OpenAlexW44636219MaRDI QIDQ3166848

Diana Hay, Jason Ekstrand, Jolie Roat, Craig Erickson, Leslie Hogben

Publication date: 1 November 2012

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://lib.dr.iastate.edu/math_pubs/251

zbMATH Keywords

multigraphpositive semidefinitematrixminimum rankmaximum nullityzero forcing numbertree cover number

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48) Hermitian, skew-Hermitian, and related matrices (15B57) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items

On the tree cover number of a graph, Positive Semidefinite Zero Forcing: Complexity and Lower Bounds, Compressed cliques graphs, clique coverings and positive zero forcing, The Complexity of the Positive Semidefinite Zero Forcing, A new lower bound for the positive semidefinite minimum rank of a graph, An integer program for positive semidefinite zero forcing in graphs, Positive semidefinite zero forcing, Positive Zero Forcing and Edge Clique Coverings, A New Lower Bound for Positive Zero Forcing, A zero forcing technique for bounding sums of eigenvalue multiplicities, Lower bounds for positive semidefinite zero forcing and their applications, On the relationships between zero forcing numbers and certain graph coverings, On the complexity of the positive semidefinite zero forcing number, Line graphs: Their maximum nullities and zero forcing numbers, Positive semidefinite zero forcing numbers of two classes of graphs