ABSTRAK

The concept of binary digit strings and hamming distance from two binary digit strands is a fundamental concept in
the theory of error-correcting code. The number of hamming distance between two pairs of strings produced by the
matrix of the vertex-edge incidence of graph G is called Hamming index the incidence of vertex-edge of graph G and
denoted by H (G). Hamming index composite graph from matrix representation vertex-edge incidence can be made a
general formula by first determining many vertices, many sides and many degrees of each graph. Then by using the
general formula of the hamming index that has been found which is 2(n-2) m, where n = vertex and m = edge, then it
can be obtained the general formula of hamming index on composite graph, namely joint operation, corona and
cartesian multiplication.

Keyword: Hamming index, composite graph, incidence matrix.