HAMMING INDEX OF DERIVED GRAPHS

Let G be a simple and undirected graph with n vertices.The row entries corresponding to the vertex v in the adjacency matrix of G are denoted by s(v).The number of positions at which the elements of the strings s(u) and s(v) differ is the Hamming distance between them.The sum of Hamming distances between all the pairs of vertices is the Hamming index.The proposed study finds various bounds for Hamming index.It also computes the Hamming index generated by the adjacency matrix of a few derived graphs.