An upper bound for the independent domination number

DOI10.1006/jctb.1999.1907zbMath0933.05118OpenAlexW2018794757MaRDI QIDQ1306311

Liang Sun, Jian-fang Wang

Publication date: 20 December 1999

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1999.1907

zbMATH Keywords

independent domination numberindependent setsconjecture of Favaron

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Independent domination in directed graphs ⋮ On independent domination parameters of some special families of Halin graph ⋮ On upper transversals in 3-uniform hypergraphs ⋮ VERTEX VULNERABILITY PARAMETER OF GEAR GRAPHS ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Domination versus independent domination in cubic graphs ⋮ Triangle-free graphs with large independent domination number ⋮ Extremal connected graphs for independent domination number ⋮ Independent domination in triangle-free graphs ⋮ Upper bounds for independent domination in regular graphs ⋮ Independent domination number in Cayley digraphs of rectangular groups

Cites Work

• Unnamed Item
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Two relations between the parameters of independence and irredundance
• Contributions to the theory of domination, independence and irredundance in graphs
• The product of the independent domination numbers of a graph and its complement
• On minimum maximal independent sets of a graph
• On a Nordhaus-Gaddum type problem for independent domination
• Independent domination in regular graphs
• Graph-theoretic parameters concerning domination, independence, and irredundance