The following pages link to (Q4060985):
Displaying 27 items.
- Irredundancy in circular arc graphs (Q686248) (← links)
- The irredundance number and maximum degree of a graph (Q793760) (← links)
- What is the difference between the domination and independent domination numbers of a cubic graph? (Q804588) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Distance irredundance and connected domination numbers of a graph (Q860459) (← links)
- Some inequalities about connected domination number (Q1126207) (← links)
- Contributions to the theory of domination, independence and irredundance in graphs (Q1157348) (← links)
- Chordal graphs and upper irredundance, upper domination and independence (Q1174126) (← links)
- On minimum maximal independent sets of a graph (Q1182974) (← links)
- Disjoint independent dominating sets in graphs (Q1240740) (← links)
- On independent domination number of regular graphs (Q1301709) (← links)
- An upper bound for the independent domination number (Q1306311) (← links)
- The rati of the irredundance and domination number of a graph (Q1377839) (← links)
- Independent domination in regular graphs (Q1897445) (← links)
- On the independent domination number of regular graphs (Q1929752) (← links)
- Domination in fuzzy incidence graphs based on valid edges (Q2143790) (← links)
- A note on the independent domination number in graphs (Q2446901) (← links)
- A Survey of the Game “Lights Out!” (Q2848975) (← links)
- A note on the independent domination number of subset graph (Q3366736) (← links)
- Towards a theory of domination in graphs (Q4163261) (← links)
- Independent domination in signed graphs (Q5025140) (← links)
- SOME RESULTS ON WEAK DOMINATION IN GRAPHS (Q5076241) (← links)
- NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs (Q5090153) (← links)
- Independent strong weak domination: A mathematical programming approach (Q5858171) (← links)
- Partial domination and irredundance numbers in graphs (Q6096253) (← links)
- Closed formulas for the independent (Roman) domination number of rooted product graphs (Q6125366) (← links)
- On k-cost effective domination in the corona and lexicographic product of graphs and its variant (Q6132872) (← links)
