| dc.contributor.advisor | Muthu, Rahul | |
| dc.contributor.author | Kumar, Lokesh | |
| dc.date.accessioned | 2019-03-19T09:30:51Z | |
| dc.date.available | 2019-03-19T09:30:51Z | |
| dc.date.issued | 2018 | |
| dc.identifier.citation | Kumar, Lokesh (2018). Set Labeling of Graphs. Dhirubhai Ambani Institute of Information and Communication Technology, vii, 34 p. (Acc. No: T00701) | |
| dc.identifier.uri | http://drsr.daiict.ac.in//handle/123456789/735 | |
| dc.description.abstract | Given 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.publisher | Dhirubhai Ambani Institute of Information and Communication Technology | |
| dc.subject | Auxiliary graph | |
| dc.subject | Algorithms | |
| dc.subject | Machine Learning | |
| dc.classification.ddc | 004.002 KUM | |
| dc.title | Set labeling of graphs | |
| dc.type | Dissertation | |
| dc.degree | M. Tech | |
| dc.student.id | 201611007 | |
| dc.accession.number | T00701 | |
