Set labeling of graphs

dc.accession.numberT00701
dc.classification.ddc004.002 KUM
dc.contributor.advisorMuthu, Rahul
dc.contributor.authorKumar, Lokesh
dc.date.accessioned2019-03-19T09:30:51Z
dc.date.accessioned2025-06-28T10:19:32Z
dc.date.available2019-03-19T09:30:51Z
dc.date.issued2018
dc.degreeM. Tech
dc.description.abstractGiven a universal set and its subsets, intersection graph can be characterized as the graph with one distinct subset of given universal set for each vertex of the graph and any two non-adjacent vertices have no element common in their respective set. This was first studied by Erdos. For Kneser graph and Petersen graph, adjacency is characterized by disjointness. This motivates us to look at disjointness instead of intersection. This report contains results about asymptotic bounds for valid labeling of some special classes of graphs such as harary graphs, split graphs, bipartite graphs, disjoint complete graphs and complete multipartite graphs. Parameters relevant to study of labeling of vertices of the graphs are minimum label size possible (ILN), minimum universe size possible (USN) and their uniform versions such as UILN and UUSN. We have also proposed one framework to label disconnected graphs.
dc.identifier.citationKumar, Lokesh (2018). Set Labeling of Graphs. Dhirubhai Ambani Institute of Information and Communication Technology, vii, 34 p. (Acc. No: T00701)
dc.identifier.urihttp://drsr.daiict.ac.in/handle/123456789/735
dc.publisherDhirubhai Ambani Institute of Information and Communication Technology
dc.student.id201611007
dc.subjectAuxiliary graph
dc.subjectAlgorithms
dc.subjectMachine Learning
dc.titleSet labeling of graphs
dc.typeDissertation

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
201611007_Lokesh Kumar.pdf
Size:
677.05 KB
Format:
Adobe Portable Document Format
Description:
201611007