Pages that link to "Item:Q5217081"
From MaRDI portal
The following pages link to Grundy domination and zero forcing in Kneser graphs (Q5217081):
Displaying 9 items.
- An integer programming approach for solving a generalized version of the Grundy domination number (Q2032968) (← links)
- On the \(P_3\)-hull number of Kneser graphs (Q2048567) (← links)
- Grundy domination and zero forcing in regular graphs (Q2238998) (← links)
- GRUNDY DOMINATION SEQUENCES IN GENERALIZED CORONA PRODUCTS OF GRAPHS (Q5010391) (← links)
- On the L-Grundy domination number of a graph (Q5081167) (← links)
- (Q6054164) (← links)
- Graphs with equal Grundy domination and independence number (Q6108929) (← links)
- The \(q\)-analogue of zero forcing for certain families of graphs (Q6124425) (← links)
- On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme (Q6124433) (← links)
