Two relations between the parameters of independence and irredundance
From MaRDI portal
(Redirected from Two relations between the parameters of independence and irredundance)
Recommendations
Cites work
Cited in
(34)- On minimum maximal independent sets of a graph
- On independent domination number of regular graphs
- An upper bound for the independent domination number
- Domination and irredundance in cubic graphs
- Independence and upper irredundance in claw-free graphs
- Extremal connected graphs for independent domination number
- On the independent domination number of graphs with given minimum degree
- On upper transversals in 3-uniform hypergraphs
- General upper bounds on independent \(k\)-rainbow domination
- Independence, irredundance, degrees and chromatic number in graphs
- Independent domination in regular graphs
- On the independent domination number of regular graphs
- Triangle-free graphs with large independent domination number
- Bounds on domination parameters in graphs: a brief survey
- Independent domination, colorings and the fractional idomatic number of a graph
- Upper bounds for independent domination in regular graphs
- Inequalities involving the irredundance number of a graph
- Cubic graphs with large ratio of independent domination number to domination number
- A note on the independent domination number of subset graph
- Fractional domatic, idomatic, and total domatic numbers of a graph
- Irredundance
- Independent dominating sets in regular graphs
- scientific article; zbMATH DE number 3977049 (Why is no real title available?)
- scientific article; zbMATH DE number 1933059 (Why is no real title available?)
- A structural approach for independent domination of regular graphs
- Graphs with unique minimum specified domination sets
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- Towards a new framework for domination
- Depth and singular varieties of exterior edge ideals
- Domination parameters and the removal of matchings
- Independent domination, order, size, and maximum degree
- A note on independent domination in almost-regular graphs
- Independent domination in triangle-free graphs
- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
This page was built for publication: Two relations between the parameters of independence and irredundance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1100217)
