Inverse Problems and Zero Forcing for Graphs
From MaRDI portal
Publication:5039750
DOI10.1090/surv/270zbMath1505.05001OpenAlexW4285506155MaRDI QIDQ5039750
Jephian C.-H. Lin, Leslie Hogben, Bryan L. Shader
Publication date: 4 October 2022
Published in: Mathematical Surveys and Monographs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/surv/270
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs, Regular graphs of degree at most four that allow two distinct eigenvalues, On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme, The strong spectral property of graphs: graph operations and barbell partitions, Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters, The liberation set in the inverse eigenvalue problem of a graph, Orthogonal realizations of random sign patterns and other applications of the SIPP, Sparks of symmetric matrices and their graphs, Zero forcing with random sets, Constructions of cospectral graphs with different zero forcing numbers, Propagation time for probabilistic zero forcing, Product throttling
