Bounds on 2-point set domination number of a graph

DOI10.1142/S179383091850012XzbMath1380.05150OpenAlexW2781149038MaRDI QIDQ4603879

Deepti Jain, Purnima Gupta

Publication date: 23 February 2018

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179383091850012x

zbMATH Keywords

split graphdomination2-point set dominationmiddle graphpoint-set dominationblock-cactus graph

Mathematics Subject Classification ID

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

Related Items (3)

Independent 2-point set domination in graphs - II ⋮ 2-Point set domination in separable graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On approximating the minimum independent dominating set
• Finding a maximum independent set in a permutation graph
• Some inequalities about connected domination number
• Independent domination in chordal graphs
• On point-set domination in graphs. IV: Separable graphs with unique minimum psd-sets
• Domination in graphoidal covers of a graph
• Point-set domination number of a graph
• On point-set domination in graphs. II: Minimum psd-sets
• Minimal 2-point set dominating sets of a graph
• Further results on domination in graphoidally covered graphs
• Set domination in graphs

This page was built for publication: Bounds on 2-point set domination number of a graph