Nayak, Devadas C (2014) Studies in the theory of graph Labeling problems. Phd. Thesis thesis, Manipal Institute of Technology, Manipal.

Archive (ZIP) Devdas Nayak.zip - Submitted Version Restricted to Registered users only Download (731kB) | Request a copy

Abstract

The study of balance index set and friendly index set have attracted wide attention over the past two decades. A good deal of research has been done in obtaining these index sets and studying their properties. In general it is di�cult to determine the balance index set of a given graphs. Most of the existing research on this problems have focussed on some special families of graphs with simple structure. Although many results on balanced labeling and balance index set have already been published, there are still many prob- lems that we can try to solve. Kwong and Shiu [19] developed an algebraic approach to solve the balance index set problems. It shows that the balance index set depends on the degree sequence of the graph. It becomes a very powerful tool to deal with balance indexes. In this thesis, we have obtained balance index set, friendly index set and full friendly index set of certain classes of graphs, and their relationship established. The balance index number and the friendly index number of graphs are de�ned, and applied these to class of graphs. At the end, mean k4

Item Type:	Thesis (Phd. Thesis)
Subjects:	Engineering > MIT Manipal > Mathematics
Depositing User:	MIT Library
Date Deposited:	23 Mar 2016 08:56
Last Modified:	23 Mar 2016 08:56
URI:	http://eprints.manipal.edu/id/eprint/145624

Actions (login required)

View Item