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

DOI10.1016/S0012-365X(98)00160-5zbMATH Open0928.05049MaRDI QIDQ1296965FDOQ1296965

B. D. Acharya, Purnima Gupta

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)

Cites Work

• Parallel concepts in graph theory
• Point-set domination number of a graph
• Further results on domination in graphoidally covered graphs
• On point-set domination in graphs. II: Minimum psd-sets
• Title not available (Why is that?)

Cited In (11)

• Point Set and Strong Point Set Domination in Graphs 1 Minimum spsd sets
• Minimal 2-point set dominating sets of a graph
• Independent point-set dominating sets in graphs
• Bounds on 2-point set domination number of a graph
• On point-set domination in graphs. VI: Quest to characterise blocks containing independent PSD-sets
• 2-Point set domination in separable graphs
• ON 2-POINT-SET DOMINATING SETS
• Line-set domination in graphs
• Characterizing minimal point set dominating sets
• Point-set domination number of a graph
• Title not available (Why is that?)

   Recommendations

• Characterizing minimal point set dominating sets 👍 👎
• Title not available (Why is that?) 👍 👎
• On point-set domination in graphs. II: Minimum psd-sets 👍 👎
• Point-set domination number of a graph 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296965)