3 research outputs found
Secure domination number of -subdivision of graphs
Let be a simple graph. A dominating set of is a subset
such that every vertex not in is adjacent to at least one
vertex in . The cardinality of a smallest dominating set of , denoted by
, is the domination number of . A dominating set is called a
secure dominating set of , if for every , there exists a vertex
such that and is a dominating set of
. The cardinality of a smallest secure dominating set of , denoted by
, is the secure domination number of . For any , the -subdivision of is a simple graph
which is constructed by replacing each edge of with a path of length .
In this paper, we study the secure domination number of -subdivision of .Comment: 10 Pages, 8 Figure
On the Complexity of Co-secure Dominating Set Problem
A set of a graph is a dominating set of if
every vertex is adjacent to at least one vertex in A
set is a co-secure dominating set (CSDS) of a graph if
is a dominating set of and for each vertex there exists a vertex
such that and
is a dominating set of . The minimum cardinality of a co-secure dominating
set of is the co-secure domination number and it is denoted by
. Given a graph , the minimum co-secure dominating
set problem (Min Co-secure Dom) is to find a co-secure dominating set of
minimum cardinality. In this paper, we strengthen the inapproximability result
of Min Co-secure Dom for general graphs by showing that this problem can not be
approximated within a factor of for perfect elimination
bipartite graphs and star convex bipartite graphs unless P=NP. On the positive
side, we show that Min Co-secure Dom can be approximated within a factor of
for any graph with . For -regular and
-regular graphs, we show that Min Co-secure Dom is approximable within a
factor of and , respectively. Furthermore, we
prove that Min Co-secure Dom is APX-complete for -regular graphs.Comment: 12 pages, 2 figure