Jumlahan Jarak Hamming Berbobot

Abstract

The Hamming distance between two binary digits is the number of differences be- tween two series of binary numbers that have the same length according to the position of each binary digit. The sum of the Hamming distances produced by the edge-vertices incidence matrix of the graph G is called the edge-vertices inci- dence Hamming Index. The multiplicatively weighted Hamming index on graphs can be obtained from first determining the number of vertices, edges and degrees of each graph. Then, using the general formula, the sum of weighted hamming distances in a multiplicative manner is obtained, H(G) = 2m2m Pn i=0 d2 i − Pn i=0 d3 i − 2 P u v deg(u)deg(v) next, we can obtain a general formula for the Hamming index on several graphs.