Pages that link to "Item:Q1751247"
From MaRDI portal
The following pages link to Grundy dominating sequences and zero forcing sets (Q1751247):
Displayed 23 items.
- Grundy dominating sequences on \(X\)-join product (Q777371) (← links)
- Grundy domination of forests and the strong product conjecture (Q831340) (← links)
- Zero forcing number, Grundy domination number, and their variants (Q1713312) (← links)
- Brushing number and zero-forcing number of graphs and their line graphs (Q1756097) (← links)
- The variety of domination games (Q2007624) (← links)
- On graphs all of whose total dominating sequences have the same length (Q2037571) (← 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)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- Uniform length dominating sequence graphs (Q2657052) (← links)
- Power Domination in Graphs (Q3384619) (← links)
- GRUNDY DOMINATION SEQUENCES IN GENERALIZED CORONA PRODUCTS OF GRAPHS (Q5010391) (← 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)
- (Q6054164) (← links)
- Graphs with equal Grundy domination and independence number (Q6108929) (← links)
- On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme (Q6124433) (← links)
- Computation of Grundy dominating sequences in (co-)bipartite graphs (Q6184795) (← links)