Pages that link to "Item:Q3166848"
From MaRDI portal
The following pages link to Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees (Q3166848):
Displayed 15 items.
- Lower bounds for positive semidefinite zero forcing and their applications (Q512866) (← links)
- A new lower bound for the positive semidefinite minimum rank of a graph (Q1931723) (← links)
- A zero forcing technique for bounding sums of eigenvalue multiplicities (Q1979365) (← links)
- On the relationships between zero forcing numbers and certain graph coverings (Q2017194) (← links)
- Positive semidefinite zero forcing numbers of two classes of graphs (Q2319902) (← links)
- On the tree cover number of a graph (Q2357664) (← links)
- Positive semidefinite zero forcing (Q2435453) (← links)
- Compressed cliques graphs, clique coverings and positive zero forcing (Q2636506) (← links)
- Line graphs: Their maximum nullities and zero forcing numbers (Q2828813) (← links)
- The Complexity of the Positive Semidefinite Zero Forcing (Q2942442) (← links)
- Positive Semidefinite Zero Forcing: Complexity and Lower Bounds (Q3449859) (← links)
- Positive Zero Forcing and Edge Clique Coverings (Q4632169) (← links)
- A New Lower Bound for Positive Zero Forcing (Q4632220) (← links)
- On the complexity of the positive semidefinite zero forcing number (Q5962481) (← links)
- An integer program for positive semidefinite zero forcing in graphs (Q6092625) (← links)
