Pages that link to "Item:Q417526"
From MaRDI portal
The following pages link to Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph (Q417526):
Displaying 50 items.
- Using a new zero forcing process to guarantee the strong Arnold property (Q306447) (← links)
- Proof of a conjecture on the zero forcing number of a graph (Q313827) (← links)
- Extremal values and bounds for the zero forcing number (Q317429) (← links)
- A technique for computing the zero forcing number of a graph with a cut-vertex (Q417535) (← links)
- Propagation time for zero forcing on a graph (Q442213) (← links)
- Upper bounds on the \(k\)-forcing number of a graph (Q479006) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Some bounds on the zero forcing number of a graph (Q1693145) (← links)
- On the total forcing number of a graph (Q1730228) (← links)
- Bounds on the connected forcing number of a graph (Q1756082) (← links)
- Total forcing and zero forcing in claw-free cubic graphs (Q1756105) (← links)
- Effects of vertex degrees on the zero-forcing number and propagation time of a graph (Q1801062) (← links)
- A lower bound on the zero forcing number (Q1801082) (← links)
- Bounds on expected propagation time of probabilistic zero forcing (Q1979443) (← links)
- Total forcing versus total domination in cubic graphs (Q2011113) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- On the relationships between zero forcing numbers and certain graph coverings (Q2017194) (← links)
- Zero forcing versus domination in cubic graphs (Q2025087) (← links)
- Note on forcing problem of trees (Q2062888) (← links)
- On the semitotal forcing number of a graph (Q2134991) (← links)
- On the length of L-Grundy sequences (Q2172087) (← links)
- Total forcing sets and zero forcing sets in trees (Q2175233) (← links)
- On the spectrum and energy of singular graphs (Q2176154) (← links)
- Zero forcing and maximum nullity for hypergraphs (Q2185737) (← links)
- On leaky forcing and resilience (Q2243134) (← links)
- On the zero forcing number of a graph involving some classical parameters (Q2292148) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- Positive semidefinite zero forcing numbers of two classes of graphs (Q2319902) (← links)
- A computational comparison of compact MILP formulations for the zero forcing number (Q2328106) (← links)
- A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs (Q2403987) (← links)
- Extremal \(k\)-forcing sets in oriented graphs (Q2416417) (← links)
- On tight bounds for the \(k\)-forcing number of a graph (Q2421385) (← links)
- Restricted power domination and zero forcing problems (Q2424658) (← links)
- Connected power domination in graphs (Q2424811) (← links)
- Positive semidefinite zero forcing (Q2435453) (← links)
- Counterexamples to an edge spread question for zero forcing number (Q2442364) (← links)
- Multi-color forcing in graphs (Q2657055) (← links)
- Line graphs: Their maximum nullities and zero forcing numbers (Q2828813) (← links)
- On the Energy of Graphs (Q2945450) (← links)
- The forcing number of graphs with given girth (Q4639236) (← links)
- Zero forcing number of a graph in terms of the number of pendant vertices (Q4965925) (← links)
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph (Q5060771) (← links)
- On the zero forcing number of generalized Sierpinski graphs (Q5135721) (← links)
- Maximum nullity and zero forcing number of graphs with rank at most 4 (Q5193233) (← 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)
- (Q5877175) (← links)
- Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters (Q6166671) (← links)
- The zero forcing number of graphs with the matching number and the cyclomatic number (Q6172214) (← links)
