%0 Journal Article
%T The common minimal dominating signed graph
%J Transactions on Combinatorics
%I University of Isfahan
%Z 2251-8657
%A Siva Reddy, P.
%A Prashanth, B.
%D 2012
%\ 09/01/2012
%V 1
%N 3
%P 39-46
%! The common minimal dominating signed graph
%K Signed graphs
%K Switching
%K Balance
%K Common minimal dominating signed graph
%K Neighborhood
signed graph
%R 10.22108/toc.2012.1896
%X 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.
%U https://toc.ui.ac.ir/article_1896_1e6fda2b7401644ed7d16a77256e20b5.pdf