27-35
Signed Graph Equations: N() CMD(); CMD() MD(); MD() L()
Authors: P. Siva Kota Reddy and Kavita S Permi
![](/system_img/view.png)
Number of views: 409
In this paper, we obtained the following switching equivalence
characterizations: N() CMD(), CMD() MD() and MD()
L(), where N(), CMD(), MD() and L() are neighborhood signed
graph, common minimal signed graph, minimal dominating signed graph and
line signed graph of complementary signed graph of respectively.