Pages that link to "Item:Q1182974"
From MaRDI portal
The following pages link to On minimum maximal independent sets of a graph (Q1182974):
Displaying 20 items.
- Independent dominating sets in regular graphs (Q358646) (← links)
- On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7 (Q389981) (← links)
- Independent sets in graphs with given minimum degree (Q456377) (← links)
- On minimum interdependence principle (Q760984) (← links)
- Independent domination in triangle-free graphs (Q932678) (← links)
- On the independence number of minimum distance graphs (Q1275658) (← links)
- On independent domination number of regular graphs (Q1301709) (← links)
- An upper bound for the independent domination number (Q1306311) (← links)
- Semi-regular graphs of minimum independence number (Q1420601) (← links)
- On the independent domination number of graphs with given minimum degree (Q1584339) (← links)
- Independent domination in regular graphs (Q1897445) (← links)
- On the independent domination number of regular graphs (Q1929752) (← links)
- Triangle-free graphs with large independent domination number (Q1952508) (← links)
- Upper bounds for independent domination in regular graphs (Q2455589) (← links)
- Graphs such that all minimum dominating sets intersect all maximally independent sets (Q2839679) (← links)
- (Q3070898) (← links)
- A note on the independent domination number of subset graph (Q3366736) (← links)
- On Dominating Sets and Independent Sets of Graphs (Q4946835) (← links)
- Stackelberg strategies on epidemic containment games (Q6535824) (← links)
- Minimal zero forcing sets (Q6644905) (← links)
