Pages that link to "Item:Q5039750"
From MaRDI portal
The following pages link to Inverse Problems and Zero Forcing for Graphs (Q5039750):
Displaying 23 items.
- On the graph condition regarding the \(F\)-inverse cover problem (Q309948) (← links)
- A generalized inverse for graphs with absorption (Q1675661) (← links)
- A zero forcing technique for bounding sums of eigenvalue multiplicities (Q1979365) (← links)
- The inverse Voronoi problem in graphs. I: Hardness (Q2006948) (← links)
- Product throttling (Q2073191) (← links)
- Inverse problems on a graph with loops (Q2397875) (← links)
- On an extremal inverse problem in graph theory (Q3186815) (← links)
- Constructions of cospectral graphs with different zero forcing numbers (Q5078599) (← links)
- Propagation time for probabilistic zero forcing (Q5090539) (← links)
- Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs (Q6084878) (← links)
- Regular graphs of degree at most four that allow two distinct eigenvalues (Q6084879) (← links)
- On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme (Q6124433) (← links)
- The strong spectral property of graphs: graph operations and barbell partitions (Q6154374) (← links)
- Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters (Q6166671) (← links)
- The liberation set in the inverse eigenvalue problem of a graph (Q6168543) (← links)
- Orthogonal realizations of random sign patterns and other applications of the SIPP (Q6202057) (← links)
- Sparks of symmetric matrices and their graphs (Q6202068) (← links)
- Zero forcing with random sets (Q6204353) (← links)
- Bounds on zero forcing using (upper) total domination and minimum degree (Q6601135) (← links)
- The inverse nullity pair problem and the strong nullity interlacing property (Q6615436) (← links)
- An inverse eigenvalue problem for structured matrices determined by graph pairs (Q6615438) (← links)
- Spectral arbitrariness for trees fails spectacularly (Q6615753) (← links)
- Well-forced graphs (Q6650723) (← links)
