Variations in cordial labeling of graphs

dc.contributor.guide	Ghodasara , G.V.
dc.coverage.spatial	Mathematics
dc.creator.researcher	Vaghasia, S.M.
dc.date.accessioned	2019-03-27T12:42:00Z
dc.date.available	2019-03-27T12:42:00Z
dc.date.awarded	14/10/2019
dc.date.completed	2019
dc.date.registered	26/11/2013
dc.description.abstract	quotWe analyze variations in cordial labeling from survey of graph labeling newlinetechniques and investigated new graph labeling technique namely edge difference cordial labeling of graphs. Also discover new families of product cordial labeling, edge product cordial labeling, difference cordial labeling, k-difference cordial labeling for several graphs.quot newline
dc.description.note	References p. 82-89, Appendix p. 92-99
dc.format.accompanyingmaterial	None
dc.format.dimensions	-
dc.format.extent	-
dc.identifier.uri	http://hdl.handle.net/10603/235579
dc.language	English
dc.publisher.institution	Faculty of Technology
dc.publisher.place	Rajkot
dc.publisher.university	RK University
dc.relation	No of References 68
dc.rights	university
dc.source.university	University
dc.subject.keyword	Cartesian product of graph.
dc.subject.keyword	Cordial labeling
dc.subject.keyword	Dierence cordial labeling
dc.subject.keyword	Edge dierence cordial labeling
dc.subject.keyword	Edge product cordial label- ing
dc.subject.keyword	k-dierence cordial labeling
dc.subject.keyword	Path union of a graph
dc.subject.keyword	Physical Sciences,Mathematics,Mathematics
dc.subject.keyword	Product cordial labeling
dc.title	Variations in cordial labeling of graphs
dc.type.degree	Ph.D.