Two relations between the parameters of independence and irredundance
From MaRDI portal
Publication:1100217
DOI10.1016/0012-365X(88)90076-3zbMath0639.05029MaRDI QIDQ1100217
Publication date: 1988
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
On upper transversals in 3-uniform hypergraphs ⋮ Cubic graphs with large ratio of independent domination number to domination number ⋮ Independent domination in regular graphs ⋮ Domination and irredundance in cubic graphs ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Independent dominating sets in regular graphs ⋮ On the independent domination number of regular graphs ⋮ Independent domination, colorings and the fractional idomatic number of a graph ⋮ Graphs with unique minimum specified domination sets ⋮ Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack ⋮ Independence and upper irredundance in claw-free graphs ⋮ Triangle-free graphs with large independent domination number ⋮ Extremal connected graphs for independent domination number ⋮ Towards a new framework for domination ⋮ Independent domination in triangle-free graphs ⋮ Upper bounds for independent domination in regular graphs ⋮ General upper bounds on independent \(k\)-rainbow domination ⋮ On minimum maximal independent sets of a graph ⋮ A structural approach for independent domination of regular graphs ⋮ Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance ⋮ A note on the independent domination number of subset graph ⋮ Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph ⋮ Irredundance ⋮ On the independent domination number of graphs with given minimum degree ⋮ On independent domination number of regular graphs ⋮ Inequalities involving the irredundance number of a graph ⋮ An upper bound for the independent domination number
Cites Work
