Zero forcing for sign patterns

DOI10.1016/J.LAA.2013.11.049MaRDI QIDQ2451650zbMATH OpenOpenAlexFDO

Authors Felix Goldberg, A. Berman

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

\(Z\)-matrixColin de Verdière numbercolor-change rulegeneralized Laplacianminimum ranknullitysign patternsigned zero forcingzero forcing

Mathematics Subject Classification ID

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

Abstract: We introduce a new variant of zero forcing - signed zero forcing. The classical zero forcing number provides an upper bound on the maximum nullity of a matrix with a given graph (i.e. zero-nonzero pattern). Our new variant provides an analo- gous bound for the maximum nullity of a matrix with a given sign pattern. This allows us to compute, for instance, the maximum nullity of a Z-matrix whose graph is L(K_{n}), the line graph of a clique.

Recommendations

• Ranks of zero patterns and sign patterns^*
• Sign patterns that allow strong eventual nonnegativity
• Sign patterns that allow minimal semipositivity
• scientific article; zbMATH DE number 16663
• Constructions for potentially stable sign patterns
• A class of minimally spectrally arbitrary sign patterns
• scientific article; zbMATH DE number 6130221
• Sign patterns that require almost unique rank
• Inertially arbitrary sign patterns with no nilpotent realization
• Minimal Spectrally Arbitrary Sign Patterns

Cites work

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

Cited in

(13)

• 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
• Rigid linkages and partial zero forcing
• Complexity and computation of connected zero forcing
• Zero forcing and maximum nullity for hypergraphs
• Graphs of unitary matrices and positive semidefinite zero forcing
• Some properties of the closed global shadow graphs and their zero forcing number
• Line graphs: their maximum nullities and zero forcing numbers.
• Using variants of zero forcing to bound the inertia set of a graph
• Ranks of zero patterns and sign patterns^*
• A note on variants of zero forcing
• Exploring the influence of graph operations on zero forcing sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2451650)