The common minimal common neighborhood dominating signed graphs

The common minimal common neighborhood dominating signed graphs

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 equivalencec...

Full description

Bibliographic Details
Main Authors: Kavita S Permi, K.R. Rajanna, P.Siva Kota Reddy
Format: Article
Language:English
Published: University of Isfahan 2013-03-01
Series:Transactions on Combinatorics
Subjects:
Signed graphs
Balance
Switching
Common minimal $CN$-dominating signed graph
Negation
Online Access:http://www.combinatorics.ir/?_action=showPDF&article=2640&_ob=a2d2e8a781102084a706a42e292044af&fileName=full_text.pdf.

Internet

http://www.combinatorics.ir/?_action=showPDF&article=2640&_ob=a2d2e8a781102084a706a42e292044af&fileName=full_text.pdf.

Similar Items