Pages that link to "Item:Q1119604"
From MaRDI portal
The following pages link to On the product of upper irredundance numbers of a graph and its complement (Q1119604):
Displaying 15 items.
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance (Q967410) (← links)
- The product of the independent domination numbers of a graph and its complement (Q1179268) (← links)
- Lower Ramsey numbers for graphs (Q1179278) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Nordhaus--Gaddum bounds for independent domination (Q1398273) (← links)
- On a Nordhaus-Gaddum type problem for independent domination (Q1842161) (← links)
- Irredundance perfect graphs (Q1896349) (← links)
- Independent domination in regular graphs (Q1897445) (← links)
- Nordhaus-Gaddum results for CO-irredundance in graphs (Q1969790) (← links)
- Upper bounds for independent domination in regular graphs (Q2455589) (← links)
- New upper bounds for the pseudoachromatic and upper irredundance numbers of a graph (Q2878210) (← links)
- Irredundance (Q3384112) (← links)
- Generalised irredundance in graphs: Nordhaus-Gaddum bounds (Q4823302) (← links)
- Nordhaus-Gaddum bounds for upper total domination (Q5089900) (← links)