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