Pages that link to "Item:Q2799842"
From MaRDI portal
The following pages link to Cycle domination, independence, and irredundance in graphs (Q2799842):
Displaying 7 items.
- The sequence of upper and lower domination, independence and irredundance numbers of a graph (Q1313851) (← links)
- Aspects of upper defensive alliances (Q2026328) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Clique independence, domination and irredundance in graphs (Q2799813) (← links)
- Split Domination, Independence, and Irredundance in Graphs (Q2971222) (← links)
- Edge Cut Domination, Irredundance, and Independence in Graphs (Q2971262) (← links)
- INDEPENDENT AND IRREDUNDANT CYCLE TRACKING SETS OF A GRAPH: AN EFFICIENT APPROACH TO ELECTRICAL CIRCUIT ANALYSIS (Q5237593) (← links)