Pages that link to "Item:Q1713312"
From MaRDI portal
The following pages link to Zero forcing number, Grundy domination number, and their variants (Q1713312):
Displaying 17 items.
- Brushing number and zero-forcing number of graphs and their line graphs (Q1756097) (← links)
- On the zero forcing number and spectral radius of graphs (Q2121770) (← links)
- On the length of L-Grundy sequences (Q2172087) (← links)
- Z-domination game (Q2198397) (← links)
- On Grundy total domination number in product graphs (Q2214319) (← links)
- Grundy domination and zero forcing in regular graphs (Q2238998) (← links)
- On the zero forcing number of a graph involving some classical parameters (Q2292148) (← links)
- Uniform length dominating sequence graphs (Q2657052) (← links)
- The \((d-2)\)-leaky forcing number of \(Q_d\) and \(\ell\)-leaky forcing number of \(GP(n,1)\) (Q2684050) (← links)
- On the L-Grundy domination number of a graph (Q5081167) (← links)
- Grundy domination and zero forcing in Kneser graphs (Q5217081) (← links)
- Vertex sequences in graphs (Q5862692) (← links)
- Graphs with equal Grundy domination and independence number (Q6108929) (← links)
- Computation of Grundy dominating sequences in (co-)bipartite graphs (Q6184795) (← links)
- Loop zero forcing and Grundy domination in planar graphs and claw-free cubic graphs (Q6564843) (← links)
- Bounds on zero forcing using (upper) total domination and minimum degree (Q6601135) (← links)
- On the zero forcing number of the complement of graphs with forbidden subgraphs (Q6635254) (← links)
