SOME NEW  GRAPHS ARE EVEN SUM CORDIAL LABELING

Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/1141

Full metadata record

DC Field	Value	Language
dc.contributor.author	Narmatha S	-
dc.date.accessioned	2020-08-26T05:47:46Z	-
dc.date.available	2020-08-26T05:47:46Z	-
dc.date.issued	2020-02-14	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/1141	-
dc.description.abstract	Labeling is one of the research Side in Graph theory. In this paper Considering only a finite undirected graph with neither loops nor multiple edges. Let G=(V,E) be a simple graph and be a bijection. For each edge uv, assign the label 1 if is even and the label 0 otherwise. f is called the even sum cordial labeling if where and denotes the number of edges labeled with 1. Some new graphs like H-graph, Fire Cracker graph, Tadpole graph and Coconut tree graph are even sum cordial labeling.	en_US
dc.language.iso	en	en_US
dc.publisher	KG College of Arts and Science	en_US
dc.subject	Labeling	en_US
dc.subject	Even sum cordial labeling	en_US
dc.subject	H-graph	en_US
dc.subject	Fire Cracker graph	en_US
dc.subject	Tadpole graph	en_US
dc.subject	Coconut tree graph	en_US
dc.title	SOME NEW GRAPHS ARE EVEN SUM CORDIAL LABELING	en_US
dc.title.alternative	ICMARGI 2020 1ST International Conference on Multidisciplinary Academic Research and Global Innovations	en_US
dc.type	Book	en_US
Appears in Collections:	International Conference

Files in This Item:

File	Description	Size	Format
SOME NEW GRAPHS ARE EVEN SUM CORDIAL LABELING.docx		11.22 kB	Microsoft Word XML	View/Open