Hamming Index of Class of Graphs
Pages : 205-208
Let A(G) be the adjacency matrix of a graph G. The rows of A(G) corresponding to a vertex v of G, denoted by s(v) is the string which belongs to nZ2, a set of n-tuples. The Hamming distance between the vertices u and v is the number of positions in which s(u) and s(v) differ. The Hamming index of a graph G is the sum of the Hamming distances between all pairs of vertices of G. In this paper we obtain the Hamming index of certain class of graphs.
Keywords: Hamming distance, Hamming index. Adjacency matrix, Mathematics Subject Classification: 05C99
Article published in the Proceedings of National Conference on ‘Women in Science & Engineering’ (NCWSE 2013), SDMCET Dharwad