On minimum maximal independent sets of a graph

DOI10.1016/0012-365X(91)90318-VzbMath0758.05061MaRDI QIDQ1182974

Julie Haviland

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

independent domination numbermaximal independent sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (10)

Independent domination in regular graphs ⋮ Independent dominating sets in regular graphs ⋮ On the independent domination number of regular graphs ⋮ Triangle-free graphs with large independent domination number ⋮ Independent domination in triangle-free graphs ⋮ Upper bounds for independent domination in regular graphs ⋮ A note on the independent domination number of subset graph ⋮ On the independent domination number of graphs with given minimum degree ⋮ On independent domination number of regular graphs ⋮ An upper bound for the independent domination number

Cites Work

• Unnamed Item
• Unnamed Item
• Two relations between the parameters of independence and irredundance
• Contributions to the theory of domination, independence and irredundance in graphs
• On the sum of cardinalities of extremum maximal independent sets
• Graph-theoretic parameters concerning domination, independence, and irredundance

This page was built for publication: On minimum maximal independent sets of a graph