On Hamming index generated by adjacency matrix of graphs

Abstract

Abstract Let G be a finite simple graph and A be the adjacency matrix of G. Then each row of A is a bit string of finite length. Hamming distance between any two rows of A is defined to be the number of positions with different digit. For any two vertices vi and vj in graph G we define Hamming distance, generated the adjacency matrix A, between vi and vj as the Hamming distance between rows of A corresponding to the vertices vi and vj . The Hamming index of the graph G is the sum of Hamming distances over all distinct pairs of vertices vi and vj in G. This paper discuss Hamming index of finite simple graphs. We present a formula for Hamming index of graphs in terms of known parameters of the graph namely the number of vertices, the number of edges and the degree of each vertex. We then apply the formula to determine the Hamming index for some graph operations.