Product Cordial Labeling for some Bistar related Graphs

Vaidya, S.; Vyas, N.

dc.contributor.author	Vaidya, S.
dc.contributor.author	Vyas, N.
dc.date.accessioned	2023-05-20T03:19:24Z
dc.date.available	2023-05-20T03:19:24Z
dc.date.issued	2014
dc.identifier.citation	Vaidya, S. ,Vyas, N.(2014). Product Cordial Labeling for some Bistar related Graphs, AMO - Advanced Modeling and Optimization, Volume 16, Number 2, ISSN 1841-4311,https://camo.ici.ro/journal/vol16/v16b14.pdf	en_US
dc.identifier.issn	1841-4311
dc.identifier.uri	http://10.9.150.37:8080/dspace//handle/atmiyauni/1026
dc.description.abstract	For the graph G = (V (G), E(G)), a function f : V (G) → {0, 1} is called a product cordial labeling of G if the induced edge labeling function defined by the product of end vertex labels be such that the edges with label 1 and label 0 differ by at most 1 and the vertices with label 1 and label 0 also differ by at most 1. Here we investigate product cordial labeling for some bistar related graphs.	en_US
dc.language.iso	en	en_US
dc.publisher	AMO - Advanced Modeling and Optimization	en_US
dc.subject	Cordial labeling	en_US
dc.subject	Porduct cordial labeling	en_US
dc.subject	Bistar	en_US
dc.title	Product Cordial Labeling for some Bistar related Graphs	en_US
dc.type	Article	en_US