Pages that link to "Item:Q1179268"
From MaRDI portal
The following pages link to The product of the independent domination numbers of a graph and its complement (Q1179268):
Displaying 11 items.
- On the independence and domination numbers of replacement product graphs (Q258628) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- On independent domination number of regular graphs (Q1301709) (← links)
- An upper bound for the independent domination number (Q1306311) (← links)
- Relations between the lower domination parameters and the chromatic number of a graph. (Q1421509) (← links)
- On a Nordhaus-Gaddum type problem for independent domination (Q1842161) (← links)
- Independent domination in regular graphs (Q1897445) (← links)
- On the independent domination number of regular graphs (Q1929752) (← links)
- Upper bounds for independent domination in regular graphs (Q2455589) (← links)
- Associative graph products and their independence, domination and coloring numbers (Q2785650) (← links)
- Product Nordhaus-Gaddum-type results for the induced path number involving complements with respect to \(K_n\) or \(K_{n,n}\) (Q2878220) (← links)
