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

DOI10.1016/S0012-365X(98)00160-5MaRDI QIDQ1296965zbMATH OpenFDO

Authors Purnima Gupta, B. D. 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)

Recommendations

• Characterizing minimal point set dominating sets
• scientific article; zbMATH DE number 1247731
• On point-set domination in graphs. II: Minimum psd-sets
• Point-set domination number of a graph

Cites work

• scientific article; zbMATH DE number 1247731 (Why is no real title available?)
• Further results on domination in graphoidally covered graphs
• On point-set domination in graphs. II: Minimum psd-sets
• Parallel concepts in graph theory
• Point-set domination number of a graph

Cited in

(14)

• Point Set and Strong Point Set Domination in Graphs 1 Minimum spsd sets
• Minimal 2-point set dominating sets of a graph
• 2-point set domination number of a cactus
• On point-set domination in graphs. II: Minimum psd-sets
• Independent point-set dominating sets in graphs
• On point-set domination in graphs. VI: Quest to characterise blocks containing independent PSD-sets
• Bounds on 2-point set domination number of a graph
• Bounds of point-set domination number
• 2-Point set domination in separable graphs
• ON 2-POINT-SET DOMINATING SETS
• Point-set domination in graphs. VIII: Perfect and efficient PSD sets
• Line-set domination in graphs
• Characterizing minimal point set dominating 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)