Pages that link to "Item:Q317429"
From MaRDI portal
The following pages link to Extremal values and bounds for the zero forcing number (Q317429):
Displaying 34 items.
- Zero forcing propagation time on oriented graphs (Q526815) (← links)
- Some bounds on the zero forcing number of a graph (Q1693145) (← links)
- On a conjecture of Gentner and Rautenbach (Q1699556) (← links)
- On the total forcing number of a graph (Q1730228) (← 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)
- Complexity and computation of connected zero forcing (Q2012050) (← 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)
- On trees and unicyclic graphs with equal forcing-type numbers (Q2147600) (← links)
- A short proof of Zhou, Wong and Sun's conjecture (Q2174469) (← links)
- Total forcing sets and zero forcing sets in trees (Q2175233) (← 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)
- The Zero Forcing Number of Graphs (Q4610449) (← links)
- The forcing number of graphs with given girth (Q4639236) (← links)
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph (Q5060771) (← links)
- Zero forcing in Benzenoid network (Q5142119) (← links)
- Matching, path covers, and total forcing sets (Q5215393) (← links)
- On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph (Q6098089) (← links)
- UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS (Q6124016) (← links)
- On graphs maximizing the zero forcing number (Q6157420) (← links)
- Open global shadow graph and it’s zero forcing number (Q6168623) (← 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)
