Pages that link to "Item:Q2421385"
From MaRDI portal
The following pages link to On tight bounds for the \(k\)-forcing number of a graph (Q2421385):
Displaying 7 items.
- Upper bounds on the \(k\)-forcing number of a graph (Q479006) (← links)
- The effect of local majority on global majorityin connected graphs (Q1756113) (← links)
- Extremal \(k\)-forcing sets in oriented graphs (Q2416417) (← links)
- An asymptotically tight bound on the q-index of graphs with forbidden cycles (Q2969184) (← links)
- (Q3429579) (← links)
- Maximum Oriented Forcing Number for Complete Graphs (Q5205655) (← links)
- Dynamic approach to k-forcing (Q5225512) (← links)