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

Title:	SOME NEW GRAPHS ARE EVEN SUM CORDIAL LABELING
Other Titles:	ICMARGI 2020 1ST International Conference on Multidisciplinary Academic Research and Global Innovations
Authors:	Narmatha S
Keywords:	Labeling Even sum cordial labeling H-graph Fire Cracker graph Tadpole graph Coconut tree graph
Issue Date:	14-Feb-2020
Publisher:	KG College of Arts and Science
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.
URI:	http://localhost:8080/xmlui/handle/123456789/1141
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