Pages that link to "Item:Q967512"
From MaRDI portal
The following pages link to On minimum rank and zero forcing sets of a graph (Q967512):
Displaying 29 items.
- Using a new zero forcing process to guarantee the strong Arnold property (Q306447) (← links)
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph (Q417526) (← links)
- A technique for computing the zero forcing number of a graph with a cut-vertex (Q417535) (← links)
- On the minimum rank of the third power of a starlike tree (Q417547) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Infection in hypergraphs (Q1701092) (← links)
- Grundy dominating sequences and zero forcing sets (Q1751247) (← links)
- Brushing number and zero-forcing number of graphs and their line graphs (Q1756097) (← links)
- Effects of vertex degrees on the zero-forcing number and propagation time of a graph (Q1801062) (← links)
- A zero forcing technique for bounding sums of eigenvalue multiplicities (Q1979365) (← links)
- Bounds on expected propagation time of probabilistic zero forcing (Q1979443) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- On the relationships between zero forcing numbers and certain graph coverings (Q2017194) (← links)
- On the length of L-Grundy sequences (Q2172087) (← links)
- Positive semidefinite zero forcing numbers of two classes of graphs (Q2319902) (← links)
- Minimum rank and zero forcing number for butterfly networks (Q2424660) (← links)
- Connected power domination in graphs (Q2424811) (← links)
- Zero forcing for sign patterns (Q2451650) (← links)
- Multi-color forcing in graphs (Q2657055) (← links)
- The \((d-2)\)-leaky forcing number of \(Q_d\) and \(\ell\)-leaky forcing number of \(GP(n,1)\) (Q2684050) (← links)
- A New Lower Bound for Positive Zero Forcing (Q4632220) (← links)
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph (Q5060771) (← links)
- Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)
- On the zero forcing number of generalized Sierpinski graphs (Q5135721) (← links)
- Connected zero forcing sets and connected propagation time of graphs (Q5139339) (← links)
- (Q5374237) (← links)
- (Q5855594) (← links)
- On the complexity of the positive semidefinite zero forcing number (Q5962481) (← links)
- Graphs with equal Grundy domination and independence number (Q6108929) (← links)
