TY - JOUR
T1 - Hamming distance between the strings generated by adjacency matrix of a subgraph complementary graph and their sum
AU - Nayak, Swati
AU - Upadhyay, Shankar
AU - D'souza, Sabitha
AU - Bhat, Pradeep G.
N1 - Publisher Copyright:
© 2022 World Scientific Publishing Company.
PY - 2022
Y1 - 2022
N2 - Let A(G) be the adjacency matrix of a graph G. Let s(v) denote the row entries of A(G) corresponding to the vertex v of G. The Hamming distance between the strings s(u) and s(v) is the number of positions in which s(u) and s(v) differ. In this paper, we study the Hamming distance between the strings generated by the adjacency matrix of subgraph complement of a graph. We also compute sum of Hamming distances between all pairs of strings generated by the adjacency matrix of G ⊕ S.
AB - Let A(G) be the adjacency matrix of a graph G. Let s(v) denote the row entries of A(G) corresponding to the vertex v of G. The Hamming distance between the strings s(u) and s(v) is the number of positions in which s(u) and s(v) differ. In this paper, we study the Hamming distance between the strings generated by the adjacency matrix of subgraph complement of a graph. We also compute sum of Hamming distances between all pairs of strings generated by the adjacency matrix of G ⊕ S.
UR - http://www.scopus.com/inward/record.url?scp=85132516183&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85132516183&partnerID=8YFLogxK
U2 - 10.1142/S1793830922501026
DO - 10.1142/S1793830922501026
M3 - Article
AN - SCOPUS:85132516183
SN - 1793-8309
JO - Discrete Mathematics, Algorithms and Applications
JF - Discrete Mathematics, Algorithms and Applications
M1 - 2250102
ER -