Pages that link to "Item:Q3166908"
From MaRDI portal
The following pages link to Positive semidefinite maximum nullity and zero forcing number (Q3166908):
Displaying 27 items.
- Using a new zero forcing process to guarantee the strong Arnold property (Q306447) (← links)
- Fractional zero forcing via three-color forcing games (Q313806) (← links)
- Minimum rank, maximum nullity and zero forcing number for selected graph families (Q618709) (← links)
- Positive semidefinite propagation time (Q897615) (← links)
- On minimum rank and zero forcing sets of a graph (Q967512) (← links)
- Zero forcing parameters and minimum rank problems (Q975607) (← links)
- Families of graphs with maximum nullity equal to zero forcing number (Q1642895) (← links)
- Upper bounds for positive semidefinite propagation time (Q2144516) (← links)
- Zero forcing and maximum nullity for hypergraphs (Q2185737) (← links)
- Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph'' (Q2217786) (← links)
- Achievable multiplicity partitions in the inverse eigenvalue problem of a graph (Q2302881) (← links)
- Positive semidefinite zero forcing numbers of two classes of graphs (Q2319902) (← links)
- Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph (Q2363102) (← links)
- Positive semidefinite zero forcing (Q2435453) (← links)
- Maximum nullity and zero forcing of circulant graphs (Q2663691) (← links)
- Line graphs: Their maximum nullities and zero forcing numbers (Q2828813) (← links)
- Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees (Q3166848) (← links)
- Using variants of zero forcing to bound the inertia set of a graph (Q3448171) (← links)
- Positive Zero Forcing and Edge Clique Coverings (Q4632169) (← links)
- A New Lower Bound for Positive Zero Forcing (Q4632220) (← links)
- Tight Frame Graphs Arising as Line Graphs (Q4987379) (← links)
- Connected zero forcing sets and connected propagation time of graphs (Q5139339) (← links)
- Tree cover number and maximum semidefinite nullity of some graph classes (Q5139648) (← links)
- The maximum nullity of a complete subdivision graph is equal to its zero forcing number (Q5501680) (← links)
- On the complexity of the positive semidefinite zero forcing number (Q5962481) (← links)
- The \(q\)-analogue of zero forcing for certain families of graphs (Q6124425) (← links)
- Sparks of symmetric matrices and their graphs (Q6202068) (← links)
