%0 Journal Article
%T The common minimal dominating signed graph
%A P. Siva Reddy
%A B. Prashanth
%J Transactions on Combinatorics
%D 2012
%I University of Isfahan
%X In this paper, we define the common minimal dominating signedgraph of a given signed graph and offer a structuralcharacterization of common minimal dominating signed graphs. Inthe sequel, we also obtained switching equivalencecharacterizations: $overline{S} sim CMD(S)$ and $CMD(S) simN(S)$, where $overline{S}$, $CMD(S)$ and $N(S)$ are complementarysigned graph, common minimal signed graph and neighborhood signedgraph of $S$ respectively.
%K Signed graphs
%K Switching
%K Balance
%K Common minimal dominating signed graph
%K Neighborhood signed graph
%U http://www.combinatorics.ir/?_action=showPDF&article=1896&_ob=1e6fda2b7401644ed7d16a77256e20b5&fileName=full_text.pdf