Inverse Problems and Zero Forcing for Graphs
From MaRDI portal
Recommendations
- On an extremal inverse problem in graph theory
- Inverse problems in the theory of distance-regular graphs
- Inverse problems in graph theory: nets
- Generalized inverses in graph theory
- Inverse problems of graph theory: graphs without triangles
- Gelfand's inverse problem for the graph Laplacian
- Inverse problems of graph theory: generalized quadrangles
- Inverse problems on a graph with loops
- A generalized inverse for graphs with absorption
- On inverse problems for the cycle graph operator
Cited in
(41)- The inverse eigenvalue problem of a graph
- On an extremal inverse problem in graph theory
- Propagation time for probabilistic zero forcing
- Orthogonalisability of joins of graphs
- On the number of minimal forts of a graph
- New structures and their applications to variants of zero forcing and propagation time
- The inverse Voronoi problem in graphs. I: Hardness
- Compatible forts and maximum nullity of a graph
- 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
- On the graph condition regarding the F-inverse cover problem
- Bounds on zero forcing using (upper) total domination and minimum degree
- The liberation set in the inverse eigenvalue problem of a graph
- Constructions of cospectral graphs with different zero forcing numbers
- Spectral arbitrariness for trees fails spectacularly
- The inverse nullity pair problem and the strong nullity interlacing property
- An inverse eigenvalue problem for structured matrices determined by graph pairs
- Graphs with bipartite complement that admit two distinct eigenvalues
- Well-failed graphs
- A generalized inverse for graphs with absorption
- A combinatorial bound on the number of distinct eigenvalues 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
- Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs
- Hypergraph burning, matchings, and zero forcing
- Well-forced graphs
- The classification of graphs on eight vertices with coinciding zero forcing number and maximum nullity
- Inverse problems on a graph with loops
- The weak version of the graph complement conjecture and partial results for the delta conjecture
- Regular graphs of degree at most four that allow two distinct eigenvalues
- Spreading in claw-free cubic graphs
- Inverse eigenvalue problem for discrete Schrödinger operators of a graph
- Product throttling
- Inverse eigenvalue problem for Laplacian matrices of a graph
- Graph products that allow two distinct eigenvalues
- Probabilistic zero forcing with vertex reversion
- The minimum number of distinct eigenvalues of a threshold graph is at most 4
- A zero forcing technique for bounding sums of eigenvalue multiplicities
- On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme
- Leaky positive semidefinite forcing on graphs
This page was built for publication: Inverse Problems and Zero Forcing for Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5039750)
