Please use this identifier to cite or link to this item: http://13.232.72.61:8080/jspui/handle/123456789/548
Full metadata record
DC FieldValueLanguage
dc.contributor.authorReddy, P. Siva Kota-
dc.contributor.authorPrashanth, B.-
dc.date.accessioned2018-12-06T12:20:54Z-
dc.date.available2018-12-06T12:20:54Z-
dc.date.issued2013-11-
dc.identifier.citationReddy, P. Siva Kota., & Prashanth, B. (2013). A Note on Minimal Dominating Signed Graphs. International Journal of Mathematical Combinatorics, 4, 96-102.en_US
dc.identifier.urihttps://zenodo.org/record/825727/files/ANoteOnMinimalDominating.pdf-
dc.identifier.urihttp://13.232.72.61:8080/jspui/handle/123456789/548-
dc.description.abstractIn this note, we study minimal dominating signed graphs and obtain struc- tural characterization of minimal dominating signed graphs. Further, we characterize signed graphs S for which MD(S) ∼ CMD(S), where ∼ denotes switching equivalence and MD(S) and CMD(S) are denotes the minimal dominating signed graph and common minimal dom- inating signed graph of S respectively.en_US
dc.language.isoenen_US
dc.publisherInternational J.Math. Combin.en_US
dc.subjectMathematicsen_US
dc.subjectSigned graphsen_US
dc.titleA Note on Minimal Dominating Signed Graphs.en_US
dc.typeArticleen_US
Appears in Collections:Articles

Files in This Item:
File Description SizeFormat 
Note on Minimal Dominating Signed Graphs.pdf146.53 kBAdobe PDFView/Open


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