Triangle-free graphs with large independent domination number

DOI10.1016/J.DISOPT.2010.02.004zbMath1264.05095OpenAlexW2034417964MaRDI QIDQ1952508

Wai Hong Chan, Wai Chee Shiu, Xue-gang Chen

Publication date: 31 May 2013

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

Full work available at URL: https://doi.org/10.1016/j.disopt.2010.02.004

zbMATH Keywords

independent domination numbertriangle-free graphs

Mathematics Subject Classification ID

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

Related Items (2)

Domination versus independent domination in cubic graphs ⋮ Independent dominating sets in triangle-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independent domination in triangle-free graphs
• Two relations between the parameters of independence and irredundance
• On minimum maximal independent sets of a graph
• An upper bound for the independent domination number
• Upper bounds for independent domination in regular graphs

This page was built for publication: Triangle-free graphs with large independent domination number