K. P.

Hamming energy of certain graph products derived from regular circulant graphs

Let $G$ be a graph of order $n$. The hamming matrix $H(G) = [h_{ij}]$ of $G$ is an $n \times n$ matrix whose $(i,j)$-entry is the hamming distance between the strings $s(v_i)$ and $s(v_j)$. The hamming energy $HE(G)$ of a graph $G$ is the sum of the absolute values of the eigenvalues of $H(G)$. In this paper, we study...