Independent point-set dominating sets in graphs
In this paper, we study graphs which possess an independent point-set dominating set (in short, ipsd-set). We call such a graph as an ipsd-graph. We first provide general structural characterization of separable ipsd-graphs and thereafter, in our quest to characterize such graphs, we establish that...
Main Authors: | Purnima Gupta, Alka Goyal, Ranjana Jain |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2020-01-01
|
Series: | AKCE International Journal of Graphs and Combinatorics |
Subjects: | |
Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.08.001 |
Similar Items
-
Minimal 2-point set dominating sets of a graph
by: Deepti Jain, et al.
Published: (2017-08-01) -
Characterizing minimal point set dominating sets
by: Purnima Gupta, et al.
Published: (2016-12-01) -
Independent 2-point set domination in graphs - II
by: Deepti Jain, et al.
Published: (2022-09-01) -
Independent set dominating sets in bipartite graphs
by: Bohdan Zelinka
Published: (2005-01-01) -
Making a Dominating Set of a Graph Connected
by: Li Hengzhe, et al.
Published: (2018-11-01)