Pages that link to "Item:Q4908829"
From MaRDI portal
The following pages link to Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph (Q4908829):
Displayed 18 items.
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph (Q5060771) (← links)
- Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)
- (Q5094088) (← links)
- Connected zero forcing sets and connected propagation time of graphs (Q5139339) (← links)
- Throttling for Zero Forcing and Variants (Q5206911) (← links)
- Matching, path covers, and total forcing sets (Q5215393) (← links)
- Grundy domination and zero forcing in Kneser graphs (Q5217081) (← links)
- On zero forcing number of graphs and their complements (Q5245854) (← links)
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization (Q5737726) (← links)
- (Q5855594) (← 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)
- On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme (Q6124433) (← links)
- (Q6134963) (← links)
- On graphs maximizing the zero forcing number (Q6157420) (← links)
- The zero forcing number of graphs with the matching number and the cyclomatic number (Q6172214) (← links)
- Bounding the total forcing number of graphs (Q6181334) (← links)
- Sparks of symmetric matrices and their graphs (Q6202068) (← links)