Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/352642
Title: Extensions of Edge Graceful Labeling of Graphs
Researcher: Joel Suresh A
Guide(s): Gayathri, B
Keywords: Mathematics
Physical Sciences
University: Bharathidasan University
Completed Date: 2017
Abstract: This work deals with graph labeling. All the graphs considered newlinehere are finite and undirected unless otherwise specified. The terms not newlinedefined here are used in the sense of Harary [12]. newlineA graph labeling is an assignment of integers to the vertices or newlineedges or both subject to certain conditions. If the domain of the mapping newlineis the set of vertices (or edges) then the labeling is called a vertex newlinelabeling (or an edge labeling). newline
Pagination: 
URI: http://hdl.handle.net/10603/352642
Appears in Departments:Department of Mathematics

Files in This Item:
File Description SizeFormat 
80_recommendation.pdfAttached File79.35 kBAdobe PDFView/Open
acknowledgement.pdf43.36 kBAdobe PDFView/Open
certificate.pdf37.85 kBAdobe PDFView/Open
chapter 10.pdf3.9 MBAdobe PDFView/Open
chapter 1.pdf405.61 kBAdobe PDFView/Open
chapter 2.pdf113.35 kBAdobe PDFView/Open
chapter 3.pdf1.7 MBAdobe PDFView/Open
chapter 4.pdf10.62 MBAdobe PDFView/Open
chapter 5.pdf1.36 MBAdobe PDFView/Open
chapter 6.pdf1.38 MBAdobe PDFView/Open
chapter 7.pdf1.74 MBAdobe PDFView/Open
chapter 8.pdf7.97 MBAdobe PDFView/Open
chapter 9.pdf1.25 MBAdobe PDFView/Open
conclusion.pdf79.35 kBAdobe PDFView/Open
contents.pdf18.63 kBAdobe PDFView/Open
declaration.pdf4.56 kBAdobe PDFView/Open
references.pdf89.97 kBAdobe PDFView/Open
title page.pdf1.23 MBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: