Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/1026
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVaidya, S.-
dc.contributor.authorVyas, N.-
dc.date.accessioned2023-05-20T03:19:24Z-
dc.date.available2023-05-20T03:19:24Z-
dc.date.issued2014-
dc.identifier.citationVaidya, 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.pdfen_US
dc.identifier.issn1841-4311-
dc.identifier.urihttp://10.9.150.37:8080/dspace//handle/atmiyauni/1026-
dc.description.abstractFor 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.isoenen_US
dc.publisherAMO - Advanced Modeling and Optimizationen_US
dc.subjectCordial labelingen_US
dc.subjectPorduct cordial labelingen_US
dc.subjectBistaren_US
dc.titleProduct Cordial Labeling for some Bistar related Graphsen_US
dc.typeArticleen_US
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
903) 13056_Nirav Bipinkumar Vyas.pdf431.56 kBAdobe PDFView/Open
Show simple item record


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