Please use this identifier to cite or link to this item: http://13.232.72.61:8080/jspui/handle/123456789/552
Full metadata record
DC FieldValueLanguage
dc.contributor.authorReddy, P. Siva Kota-
dc.contributor.authorSamanta, P. N.-
dc.contributor.authorPermi, Kavita S-
dc.date.accessioned2018-12-06T12:21:41Z-
dc.date.available2018-12-06T12:21:41Z-
dc.date.issued2015-
dc.identifier.citationReddy, P. Siva Kota., Samanta, P. N., & Permi, Kavita. S. (2015). On signed graphs whose two path signed graphs are switching equivalent to their jump signed graphs. International Journal of Mathematical Combinatorics, 1, 74.en_US
dc.identifier.issn1937-1055-
dc.identifier.urihttps://pdfs.semanticscholar.org/75ac/b847e15145ac9d248b11a4d11ca4cb84e958.pdf-
dc.identifier.urihttp://13.232.72.61:8080/jspui/handle/123456789/552-
dc.description.abstractIn this paper, we obtained a characterization of signed graphs whose jump signed graphs are switching equivalent to their two path signed graphs.en_US
dc.language.isoenen_US
dc.publisherInternational J.Math. Combin.en_US
dc.subjectMathematicsen_US
dc.subjectSigned graphsen_US
dc.subjectSwitchingen_US
dc.titleOn Signed Graphs Whose Two Path Signed Graphs are Switching Equivalent to Their Jump Signed Graphsen_US
dc.typeArticleen_US
Appears in Collections:Articles



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