H-Irregular Total Labeling Of Connected Graphs

Abstract

A labelling α is a vertex H irregular k-labelling of graph in which we assign the value from {1, 2, 3, · · · , k} to the vertices for this the weight of Hi and Hj is different for i 6= j. The vertex weight of any H can be calculated by adding the labels of the vertices which are includes in H. A labelling α is edge H irregular k-labelling α of graph in which we assign the value from {1, 2, 3, · · · , k} to the edges for this the weight of Hi and Hj is different for i 6= j. The weight of any H can be calculated by adding the labels of edges which are includes in H. In this thesis we find the vertex and edge H irregular k-labellings of Starphene graph, ladder graph, triangular ladder graph and double gear graph. Key words: The vertex and edge H irregular k-labellings starphene graph and gear graph.