Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/1026
Title: Product Cordial Labeling for some Bistar related Graphs
Authors: Vaidya, S.
Vyas, N.
Keywords: Cordial labeling
Porduct cordial labeling
Bistar
Issue Date: 2014
Publisher: AMO - Advanced Modeling and Optimization
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
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.
URI: http://10.9.150.37:8080/dspace//handle/atmiyauni/1026
ISSN: 1841-4311
Appears in Collections:01. Journal Articles

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


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