Hamming Index of the Product of Two Graphs

A. Harshitha; Swati Nayak; Sabitha D’souza; Pradeep G. Bhat

Hamming Index of the Product of Two Graphs

A. Harshitha, Swati Nayak, Sabitha D’souza, Pradeep G. Bhat

Research output: Contribution to journal › Article › peer-review

Abstract

Let A(G) be the adjacency matrix of a graph G. Let s(v_i) denote the row entries of A(G) corresponding to the vertex v_i of G. The Hamming distance between the strings s(u_i) and s(v_i) 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 language	English
Pages (from-to)	1065-1072
Number of pages	8
Journal	Engineering Letters
Volume	30
Issue number	3
Publication status	Published - 2022

All Science Journal Classification (ASJC) codes

Engineering(all)

Cite this

@article{b38e0bb910bb49099fe15923e67012eb,

title = "Hamming Index of the Product of Two Graphs",

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.",

author = "A. Harshitha and Swati Nayak and Sabitha D{\textquoteright}souza and Bhat, {Pradeep G.}",

year = "2022",

language = "English",

volume = "30",

pages = "1065--1072",

journal = "Engineering Letters",

issn = "1816-093X",

publisher = "International Association of Engineers",

number = "3",

}

TY - JOUR

T1 - Hamming Index of the Product of Two Graphs

AU - Harshitha, A.

AU - Nayak, Swati

AU - D’souza, Sabitha

AU - Bhat, Pradeep G.

PY - 2022

Y1 - 2022

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85137267795&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85137267795&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85137267795

SN - 1816-093X

VL - 30

SP - 1065

EP - 1072

JO - Engineering Letters

JF - Engineering Letters

IS - 3

ER -

Hamming Index of the Product of Two Graphs

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this