Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/14202
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorHegde, S. M.-
dc.contributor.authorKumudakshi-
dc.date.accessioned2020-06-26T11:09:31Z-
dc.date.available2020-06-26T11:09:31Z-
dc.date.issued2017-
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/14202-
dc.description.abstractIn this thesis, two types of graph labeling problems has been studied namely, graceful and sequential labeling problems of digraphs. The use of modular arithmetic in these labeling ties them to a variety of algebraic problems. Using some of the algebraic structures such as (v; k; λ) di erence set, complete mapping and partition theory the gracefulness of some known class of digraphs has been proved. A construction of bigraphs from digraphs (vice-versa) are given using an adjacency matrix. Using this constructive method it is proved that, the graceful labelings of some class of bigraphs gives rise to graceful digraphs and vice-versa. Further, a relationship between the sequential labelings and graceful labelings of digraphs has been given. With this relation it is proved that, the sequential digraphs are related to near complete mappings and cyclic multiplicative groups. Also, for some more class of digraphs its gracefulness and sequentialness has been proved.en_US
dc.language.isoenen_US
dc.publisherNational Institute of Technology Karnataka, Surathkalen_US
dc.subjectDepartment of Mathematical and Computational Sciencesen_US
dc.subjectAlgebraic structuresen_US
dc.subjectZero-sequencingen_US
dc.subjectTournamenten_US
dc.subjectPartitionsen_US
dc.subjectSubset sum problemsen_US
dc.titleA Study on Labelings of Directed Graphsen_US
dc.typeThesisen_US
Appears in Collections:1. Ph.D Theses

Files in This Item:
File Description SizeFormat 
135028MA13F01.pdf852.58 kBAdobe PDFThumbnail
View/Open


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