Edge Vertex Prime Labeling for K2,n and K3,n Graphs

dc.contributor.author	Parmar, Yamini M
dc.date.accessioned	2022-06-07T11:25:02Z
dc.date.available	2022-06-07T11:25:02Z
dc.date.issued	2018-03-01
dc.identifier.issn	2278-9561
dc.identifier.issn	2278-957X
dc.identifier.uri	http://dspace.chitkarauniversity.edu.in/xmlui/handle/123456789/486
dc.description.abstract	In 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.iso	en	en_US
dc.relation.ispartofseries	;CHAENG/2013/49583
dc.subject	Complete bipartite graph	en_US
dc.subject	edge vertex prime labeling	en_US
dc.title	Edge Vertex Prime Labeling for K2,n and K3,n Graphs	en_US
dc.type	Article	en_US