Please use this identifier to cite or link to this item: http://dspace.chitkarauniversity.edu.in/xmlui/handle/123456789/486
Full metadata record
DC FieldValueLanguage
dc.contributor.authorParmar, Yamini M-
dc.date.accessioned2022-06-07T11:25:02Z-
dc.date.available2022-06-07T11:25:02Z-
dc.date.issued2018-03-01-
dc.identifier.issn2278-9561-
dc.identifier.issn2278-957X-
dc.identifier.urihttp://dspace.chitkarauniversity.edu.in/xmlui/handle/123456789/486-
dc.description.abstractIn my study, I inspect edge vertex prime labeling of some graphs like complete bipartite graphs K2,n & K 3,n . I proved that the graphs K 2,n for every n & K 3,n for n = 3, 4, …, 29 are edge vertex prime.en_US
dc.language.isoenen_US
dc.relation.ispartofseries;CHAENG/2013/49583-
dc.subjectComplete bipartite graphen_US
dc.subjectedge vertex prime labelingen_US
dc.titleEdge Vertex Prime Labeling for K2,n and K3,n Graphsen_US
dc.typeArticleen_US
Appears in Collections:Vol. 6 No. 2 (2018)

Files in This Item:
File Description SizeFormat 
21-Article Text-93-1-10-20190523.pdf1.44 MBAdobe PDFView/Open


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