HAMMING INDEX OF DERIVED GRAPHS

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

HAMMING INDEX OF DERIVED GRAPHS

A. Harshitha, Swati Nayak, Sabitha D’Souza^*, Pradeep G. Bhat

^*Corresponding author for this work

Department of Mathematics, Manipal Institute of Technology, Manipal

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

2 Citations (Scopus)

Abstract

Let G be a simple and undirected graph with n vertices. The row entries corresponding to the vertex v in the adjacency matrix of G are denoted by s(v). The number of positions at which the elements of the strings s(u) and s(v) differ is the Hamming distance between them. The sum of Hamming distances between all the pairs of vertices is the Hamming index. The proposed study finds various bounds for Hamming index. It also computes the Hamming index generated by the adjacency matrix of a few derived graphs.

Original language	English
Pages (from-to)	99-111
Number of pages	13
Journal	Global and Stochastic Analysis
Volume	10
Issue number	2
Publication status	Published - 01-12-2023

All Science Journal Classification (ASJC) codes

Statistics and Probability
Discrete Mathematics and Combinatorics

Cite this

@article{637fcd3fc5104ba9865b57193a0f97ed,

title = "HAMMING INDEX OF DERIVED GRAPHS",

abstract = "Let G be a simple and undirected graph with n vertices. The row entries corresponding to the vertex v in the adjacency matrix of G are denoted by s(v). The number of positions at which the elements of the strings s(u) and s(v) differ is the Hamming distance between them. The sum of Hamming distances between all the pairs of vertices is the Hamming index. The proposed study finds various bounds for Hamming index. It also computes the Hamming index generated by the adjacency matrix of a few derived graphs.",

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

year = "2023",

month = dec,

day = "1",

language = "English",

volume = "10",

pages = "99--111",

journal = "Global and Stochastic Analysis",

issn = "2248-9444",

publisher = "MUK Publications and Distribution",

number = "2",

}

TY - JOUR

T1 - HAMMING INDEX OF DERIVED GRAPHS

AU - Harshitha, A.

AU - Nayak, Swati

AU - D’Souza, Sabitha

AU - Bhat, Pradeep G.

PY - 2023/12/1

Y1 - 2023/12/1

N2 - Let G be a simple and undirected graph with n vertices. The row entries corresponding to the vertex v in the adjacency matrix of G are denoted by s(v). The number of positions at which the elements of the strings s(u) and s(v) differ is the Hamming distance between them. The sum of Hamming distances between all the pairs of vertices is the Hamming index. The proposed study finds various bounds for Hamming index. It also computes the Hamming index generated by the adjacency matrix of a few derived graphs.

AB - Let G be a simple and undirected graph with n vertices. The row entries corresponding to the vertex v in the adjacency matrix of G are denoted by s(v). The number of positions at which the elements of the strings s(u) and s(v) differ is the Hamming distance between them. The sum of Hamming distances between all the pairs of vertices is the Hamming index. The proposed study finds various bounds for Hamming index. It also computes the Hamming index generated by the adjacency matrix of a few derived graphs.

UR - https://www.scopus.com/pages/publications/85169301963

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

M3 - Article

AN - SCOPUS:85169301963

SN - 2248-9444

VL - 10

SP - 99

EP - 111

JO - Global and Stochastic Analysis

JF - Global and Stochastic Analysis

IS - 2

ER -

HAMMING INDEX OF DERIVED GRAPHS

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this