On point-set domination in graphs. IV: Separable graphs with unique minimum psd-sets

DOI10.1016/S0012-365X(98)00160-5zbMath0928.05049MaRDI QIDQ1296965

Purnima Gupta, Belmannu Devadas Acharya

Publication date: 3 August 1999

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

zbMATH Keywords

point-set dominationblock-cactus graphsconnected separable graphsunique minimum psd-sets

Mathematics Subject Classification ID

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

Related Items (8)

ON 2-POINT-SET DOMINATING SETS ⋮ Minimal 2-point set dominating sets of a graph ⋮ Line-set domination in graphs ⋮ Bounds on 2-point set domination number of a graph ⋮ Unnamed Item ⋮ Characterizing minimal point set dominating sets ⋮ Independent point-set dominating sets in graphs ⋮ Point Set and Strong Point Set Domination in Graphs 1 Minimum spsd sets

Cites Work

• Parallel concepts in graph theory
• Point-set domination number of a graph
• On point-set domination in graphs. II: Minimum psd-sets
• Further results on domination in graphoidally covered graphs
• Unnamed Item

This page was built for publication: On point-set domination in graphs. IV: Separable graphs with unique minimum psd-sets