The common minimal common neighborhood dominating signed graphs

Kavita S Permi, K.R. Rajanna, P.Siva Kota Reddy
2013 Transactions on Combinatorics  
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.
doaj:f701a79d45ac40ed93481aaf2b4f47e7 fatcat:egzjthkn2fbabbiqxacamvh4ke