Hamming Index of the Product of Two Graphs

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

Let A(G) be the adjacency matrix of a graph G. Let s(vi) denote the row entries of A(G) corresponding to the vertex vi of G. The Hamming distance between the strings s(ui) and s(vi) is the number of positions in which their elements differ. The sum of Hamming distance between all the pairs of vertices is the Hamming index of a graph. In this paper, we study the Hamming distance between the strings generated by the adjacency matrix of various products of complete bipartite and complete graph. We also compute the Hamming index generated by the adjacency matrix of these graph products.

Original languageEnglish
Pages (from-to)1065-1072
Number of pages8
JournalEngineering Letters
Volume30
Issue number3
Publication statusPublished - 2022

All Science Journal Classification (ASJC) codes

  • General Engineering

Fingerprint

Dive into the research topics of 'Hamming Index of the Product of Two Graphs'. Together they form a unique fingerprint.

Cite this