Pages that link to "Item:Q804588"
From MaRDI portal
The following pages link to What is the difference between the domination and independent domination numbers of a cubic graph? (Q804588):
Displaying 18 items.
- Cubic graphs with large ratio of independent domination number to domination number (Q295260) (← links)
- Domination versus independent domination in cubic graphs (Q385388) (← links)
- The independent domination number of a cubic 3-connected graph can be much larger than its domination number (Q687719) (← links)
- On the differences between the upper irredundance, upper domination and independence numbers of a graph (Q1301668) (← links)
- Disproof of a conjecture in the domination theory (Q1343234) (← links)
- Domination and irredundance in cubic graphs (Q1356461) (← links)
- Inequalities relating domination parameters in cubic graphs (Q1815314) (← links)
- On the independent domination number of regular graphs (Q1929752) (← links)
- Independent domination in bipartite cubic graphs (Q2000581) (← links)
- An improved upper bound on the independent domination number in cubic graphs of girth at least six (Q2115169) (← links)
- On independent domination in planar cubic graphs (Q2312063) (← links)
- A counterexample to conjecture of Barefoot, Harary, and Jones (Q2366962) (← links)
- Independent domination in hypercubes (Q2367974) (← links)
- Independent domination in subcubic graphs of girth at least six (Q2411611) (← links)
- The domination parameters of cubic graphs (Q2484159) (← links)
- Domination in cubic graphs (Q3972021) (← links)
- Independent domination in signed graphs (Q5025140) (← links)
- Domination versus independent domination in regular graphs (Q6056756) (← links)