On domination and annihilation in graphs with claw-free blocks

DOI10.1016/S0012-365X(00)00313-7zbMath0973.05057WikidataQ127720388 ScholiaQ127720388MaRDI QIDQ5937584

Dieter Rautenbach, Odile Favaron, Michael A. Henning, Joël Puech

Publication date: 28 November 2001

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

zbMATH Keywords

blockannihilationclawdominationirredundance

Mathematics Subject Classification ID

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

Related Items (9)

Bounding the locating-total domination number of a tree in terms of its annihilation number ⋮ On the total \(k\)-domination in graphs ⋮ Total \(k\)-domination in Cartesian product graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ On (1,2)-domination in cubic graphs ⋮ Irredundance ⋮ Multiple Domination ⋮ On the signed 2-independence number of graphs ⋮ On general frameworks and threshold functions for multiple domination

This page was built for publication: On domination and annihilation in graphs with claw-free blocks