HAMMING DISTANCE OF A SEMIGRAPH

Suppose that A(G) represents the adjacency matrix of a graph. Let s(v) represent the row elements of A(G) that correspond to vertex v of G. The number of places where the elements of the strings s(u) and s(v) differ from one another is known as the Hamming distance between u and v. The total sum of all Hamming distances between every pair of strings is the graph’s hamming index. A semigraph G is a generalization of a graph G. In a semigraph, an edge can contain more than two vertices. The hamming distance and hamming index of a semigraph G are defined in this article. Also, we determine the hamming distance and hamming index of some classes of semigraph G generated by A(G).