Zero forcing for sign patterns

DOI10.1016/j.laa.2013.11.049zbMath1288.05156arXiv1307.2198OpenAlexW2027391679MaRDI QIDQ2451650

Abraham Berman, Felix Goldberg

Publication date: 4 June 2014

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

Full work available at URL: https://arxiv.org/abs/1307.2198

zbMATH Keywords

nullityColin de Verdière numbersign patternminimum rankzero forcinggeneralized Laplacian\(Z\)-matrixcolor-change rulesigned zero forcing

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Games on graphs (graph-theoretic aspects) (05C57) Sign pattern matrices (15B35)

Related Items (4)

Computational approaches for zero forcing and related problems ⋮ The zero forcing polynomial of a graph ⋮ A zero forcing technique for bounding sums of eigenvalue multiplicities ⋮ Complexity and computation of connected zero forcing

Cites Work

• Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns
• On minimum rank and zero forcing sets of a graph
• The minimum rank of symmetric matrices described by a graph: a survey
• Linear operators which preserve sign-nonsingular matrices
• Zero forcing sets and the minimum rank of graphs
• The inertia set of a signed graph
• Sign patterns with minimum rank 2 and upper bounds on minimum ranks
• A note on minimum rank and maximum nullity of sign patterns
• Some outstanding problems in the theory of matrices
• Computer reconstruction of small graphs
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
• Discrete nodal domain theorems

This page was built for publication: Zero forcing for sign patterns