%0 Journal Article
%T The common minimal common neighborhood dominating signed graphs
%A P.Siva Kota Reddy
%A K.R. Rajanna
%A Kavita S Permi
%J Transactions on Combinatorics
%D 2013
%I University of Isfahan
%X In this paper, we define the common minimal common neighborhooddominating signed graph (or common minimal $CN$-dominating signedgraph) of a given signed graph and offer a structuralcharacterization of common minimal $CN$-dominating signed graphs.In the sequel, we also obtained switching equivalencecharacterization: $overline{Sigma} sim CMCN(Sigma)$, where$overline{Sigma}$ and $CMCN(Sigma)$ are complementary signedgraph and common minimal $CN$-signed graph of $Sigma$respectively.
%K Signed graphs
%K Balance
%K Switching
%K Common minimal $CN$-dominating signed graph
%K Negation
%U http://www.combinatorics.ir/?_action=showPDF&article=2640&_ob=a2d2e8a781102084a706a42e292044af&fileName=full_text.pdf.