Please use this identifier to cite or link to this item:

`http://hdl.handle.net/10603/194491`

Title: | Set labelling vertices and study of auxiliary graphs |

Researcher: | Jadeja, mahipal |

Guide(s): | Rahul Muthu |

Keywords: | Graph Visualization Object Treemap Set labelling intersection number vertex labelling Information visualization Taxonomy social network analysis, |

University: | Dhirubhai Ambani Institute of Information and Communication Technology (DA-IICT) |

Completed Date: | February 2018 |

Abstract: | quotGiven a set of nonempty subsets of some universal set, their intersection graph is defined as the graph with one vertex for each set and two vertices are adjacent precisely when their representing sets have non-empty intersection. Sometimes these sets are finite, but in many well known examples like geometric graphs (including interval graphs) they are infinite. One can also study the reverse problem of expressing the vertices of a given graph as distinct sets in such a way that adjacency newlinecoincides with intersection of the corresponding sets. The sets are usually required to conform to some template, depending on the problem, to be either a finite set, or some geometric set like intervals, circles, discs, cubes etc. The problem of representing a graph as an intersection graph of sets was first introduced by Erdos et al. and they looked at minimising the underlying universal set necessary to represent any given graph. In that paper it was shown that the problem is NP complete. In this thesis, we study a natural variant of this problem which is to consider graphs where vertices represent distinct sets and adjacency coincides with disjointness. Although this is nearly the same problem on the complement graph, for specific families of graphs this is a more natural way of newlineviewing it. The parameters we take into account are the minimum universe size possible (USN), the minimum individual label size possible (ILN) and their uniform versions (UUSN and UILN respectively). newline newlineWe propose two applications related to information visualization which use newlinethe same underlying idea: assignment of unique labels to each vertex of a graph (or tree) and removal of all edges. A pair of nodes is adjacent if and only if their corresponding labels are disjoint. The proposed newlinelabelling scheme can be used to establish isomorphism and study of ontologies. newline newlineInformation visualization is a class of techniques which is used to present data in a graphical or pictorial format. |

Pagination: | xv, 164 p. |

URI: | http://hdl.handle.net/10603/194491 |

Appears in Departments: | Department of Information and Communication Technology |

Files in This Item:

File | Description | Size | Format | |
---|---|---|---|---|

01_title.pdf | Attached File | 82.44 kB | Adobe PDF | View/Open |

02_declaration and certificate.pdf | 81.15 kB | Adobe PDF | View/Open | |

03_acknowledgements.pdf | 60.98 kB | Adobe PDF | View/Open | |

04_contents.pdf | 119.76 kB | Adobe PDF | View/Open | |

05_abstract.pdf | 94.38 kB | Adobe PDF | View/Open | |

06_list of table.pdf | 58.07 kB | Adobe PDF | View/Open | |

07_list of figures.pdf | 141.9 kB | Adobe PDF | View/Open | |

08_chapter 1.pdf | 275.27 kB | Adobe PDF | View/Open | |

09_chapter 2.pdf | 1.29 MB | Adobe PDF | View/Open | |

10_chapter 3.pdf | 978.05 kB | Adobe PDF | View/Open | |

11_chapter 4.pdf | 460.33 kB | Adobe PDF | View/Open | |

12_chapter 5.pdf | 566.04 kB | Adobe PDF | View/Open | |

13_chapter 6.pdf | 443.02 kB | Adobe PDF | View/Open | |

14_chapter 7.pdf | 337.51 kB | Adobe PDF | View/Open | |

15_chapter 8.pdf | 154.1 kB | Adobe PDF | View/Open | |

16_bibliography.pdf | 102.66 kB | Adobe PDF | View/Open |

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