The common minimal common neighborhood dominating signed graphs
نویسندگان
1 Dept. of Mathematics, Acharya Institute of Technology, Bangalore-560 090, India.
2 Professor and Head Dept. of Mathematics Acharya Institute of Technology Bangalore-560 090 India
3 Assistant Professor Dept.of Mathematics Acharya Institute of Technology Bangalore-560 090 India.
doi
10.22108/toc.2013.2640چکیده
In this paper, we define the common minimal common neighborhood dominating signed graph (or common minimal $CN$-dominating signed graph) of a given signed graph and offer a structural characterization of common minimal $CN$-dominating signed graphs. In the sequel, we also obtained switching equivalence characterization: $\overline{\Sigma} \sim CMCN(\Sigma)$, where $\overline{\Sigma}$ and $CMCN(\Sigma)$ are complementary signed graph and common minimal $CN$-signed graph of $\Sigma$ respectively.