Using variants of zero forcing to bound the inertia set of a graph
From MaRDI portal
Publication:3448171
DOI10.13001/1081-3810.2900zbMath1323.05088arXiv1211.4618OpenAlexW196253256MaRDI QIDQ3448171
H. Tracy Hall, Jason Grout, Steve Butler
Publication date: 23 October 2015
Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.4618
Games involving graphs (91A43) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (10)
Computational approaches for zero forcing and related problems ⋮ An integer program for positive semidefinite zero forcing in graphs ⋮ The \(q\)-analogue of zero forcing for certain families of graphs ⋮ Reconfiguration graphs of zero forcing sets ⋮ Properties of a \(q\)-analogue of zero forcing ⋮ The zero forcing polynomial of a graph ⋮ A zero forcing technique for bounding sums of eigenvalue multiplicities ⋮ Complexity and computation of connected zero forcing ⋮ A reduction procedure for the Colin de Verdière number of a graph ⋮ The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic
Uses Software
This page was built for publication: Using variants of zero forcing to bound the inertia set of a graph
