Pages that link to "Item:Q1693145"
From MaRDI portal
The following pages link to Some bounds on the zero forcing number of a graph (Q1693145):
Displaying 48 items.
- 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)
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph (Q417526) (← links)
- Upper bounds on the \(k\)-forcing number of a graph (Q479006) (← links)
- Zero forcing number, constrained matchings and strong structural controllability (Q491112) (← links)
- Zero forcing sets and bipartite circulants (Q763073) (← links)
- Maximum nullity and zero forcing number on graphs with maximum degree at most three (Q777379) (← links)
- On the total forcing number of a graph (Q1730228) (← links)
- Forcing brushes (Q1730262) (← links)
- Bounds on the connected forcing number of a graph (Q1756082) (← links)
- Brushing number and zero-forcing number of graphs and their line graphs (Q1756097) (← links)
- Total forcing and zero forcing in claw-free cubic graphs (Q1756105) (← links)
- A lower bound on the zero forcing number (Q1801082) (← links)
- Total forcing versus total domination in cubic graphs (Q2011113) (← links)
- Zero forcing versus domination in cubic graphs (Q2025087) (← links)
- Note on forcing problem of trees (Q2062888) (← links)
- On extremal graphs for zero forcing number (Q2102756) (← links)
- On the zero forcing number and spectral radius of graphs (Q2121770) (← links)
- A short proof of Zhou, Wong and Sun's conjecture (Q2174469) (← links)
- Total forcing sets and zero forcing sets in trees (Q2175233) (← links)
- On the zero blocking number of rectangular, cylindrical, and Möbius grids (Q2185728) (← links)
- Blocking zero forcing processes in Cartesian products of graphs (Q2197448) (← links)
- From the editor-in-chief (Q2226443) (← links)
- Zero-forcing in random regular graphs (Q2226521) (← links)
- Grundy domination and zero forcing in regular graphs (Q2238998) (← links)
- On the nullity of a connected graph in terms of order and maximum degree (Q2244875) (← links)
- A short proof for a lower bound on the zero forcing number (Q2282488) (← links)
- On the zero forcing number of a graph involving some classical parameters (Q2292148) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- A computational comparison of compact MILP formulations for the zero forcing number (Q2328106) (← links)
- On tight bounds for the \(k\)-forcing number of a graph (Q2421385) (← links)
- Zero forcing in triangulations (Q2423536) (← links)
- Three-state zero forcing on graphs (Q2799862) (← links)
- On Zero Forcing Number of Permutation Graphs (Q3167349) (← links)
- The Zero Forcing Number of Graphs (Q4610449) (← links)
- The forcing number of graphs with given girth (Q4639236) (← links)
- Matching, path covers, and total forcing sets (Q5215393) (← links)
- Grundy domination and zero forcing in Kneser graphs (Q5217081) (← links)
- Bounds for the Zero Forcing Number of Graphs with Large Girth (Q5225511) (← links)
- Some algebraic hyperstructures related to zero forcing sets and forcing digraphs (Q5235366) (← links)
- (Q5245526) (← links)
- On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph (Q6098089) (← 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)
- Bounds on zero forcing using (upper) total domination and minimum degree (Q6601135) (← links)
- On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs (Q6633544) (← links)
- The zero forcing number of claw-free cubic graphs (Q6633547) (← links)
