HAMMING INDEX GENERATED BY THE INCIDENCE MATRIX OF SOME THORN GRAPHS

Abstract

Let B(G) be the incidence matrix of a graph G. The row in B(G) corresponding to a vertex v, denoted by s(v) is the string which belongs to , a set of n-tuples over a field of order two. The Hamming distance between the strings s(u) and s(v) is the number of positions in which s(u) and s(v) differ. The Hamming index is the sum of Hamming distances between all pair of vertices of G. In this paper we obtain the Hamming index of some thorn graph i.e. G^*(p_k), generated by the incidence matrix.