Pages that link to "Item:Q4277983"
From MaRDI portal
The following pages link to The ratio of the distance irredundance and domination numbers of a graph (Q4277983):
Displaying 8 items.
- Distance irredundance and connected domination numbers of a graph (Q860459) (← links)
- Irredundance number versus domination number (Q1176738) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- The rati of the irredundance and domination number of a graph (Q1377839) (← links)
- On connected \(k\)-domination numbers of graphs. (Q1421532) (← links)
- Irredundance perfect graphs (Q1896349) (← links)
- An algorithm to find two distance domination parameters in a graph (Q1917347) (← links)
- Distance irredundance in graphs: Complexity issues (Q2713632) (← links)