Please use this identifier to cite or link to this item: http://13.232.72.61:8080/jspui/handle/123456789/573
Full metadata record
DC FieldValueLanguage
dc.contributor.authorReddy, P. Siva Kota-
dc.contributor.authorRajanna, K. R.-
dc.contributor.authorPermi, Kavita. S.-
dc.date.accessioned2018-12-07T13:52:16Z-
dc.date.available2018-12-07T13:52:16Z-
dc.date.issued2013-02-
dc.identifier.citationReddy, P. Siva Kota., Rajanna, K. R., & Permi, Kavita. S. (2013). The common minimal common neighborhood dominating signed graphs. Transactions on Combinatorics, 2(1), 1-8.en_US
dc.identifier.issne-2251-8665-
dc.identifier.issnp-2251-8657-
dc.identifier.urihttp://13.232.72.61:8080/jspui/handle/123456789/573-
dc.description.abstractIn this paper, we de ne the common minimal common neighborhood dominating signed graph (or common minimal CN-dominating signed graph) of a given signed graph and o er a structural characterization of common minimal CN-dominating signed graphs. In the sequel, we also obtained switching equivalence characterization: CMCN( ), where and CMCN( ) are complementary signed graph and common minimal CN-signed graph of respectively.en_US
dc.language.isoenen_US
dc.publisherUniversity of Isfahan.en_US
dc.subjectMathematicsen_US
dc.subjectSigned graphsen_US
dc.subjectSwitchingen_US
dc.titleThe Common Minimal Common Neighborhood Dominating Signed Graphs.en_US
dc.typeArticleen_US
Appears in Collections:Articles

Files in This Item:
File Description SizeFormat 
The_common_minimal_common_neighborhood_dominating_Signed Graphs.pdf442.88 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.