Наукова електронна бібліотека
періодичних видань НАН України
періодичних видань НАН України
Hamming distance between the strings generated by adjacency matrix of a graph and their sum
Репозиторій DSpace/Manakin
JavaScript is disabled for your browser. Some features of this site may not work without it.
Hamming distance between the strings generated by adjacency matrix of a graph and their sum
Інший ID:
2010 MSC:05C99.
Посилання:
Hamming distance between the strings generated by adjacency matrix of a graph and their sum / A.B. Ganagi, H.S. Ramane // Algebra and Discrete Mathematics. — 2016. — Vol. 22, № 1. — С. 82-93. — Бібліогр.: 14 назв. — англ.
Підтримка:
Authors are thankful to Prof. P. R. Hampiholi for his suggestions.This work was carried out when the author H. S. Ramane was the employee of Gogte Institute of Technology, Belgaum, India.
Дата:
2016
Переглядів:
846
Завантажень:
274
Анотація:
Let A(G) be the adjacency matrix of a graph G. Denote by s(v) the row of the adjacency matrix corresponding to the vertex v of G. It is a string in the set Zn2 of all n-tuples over the field of order two. 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 the Hamming distance between the strings generated by the adjacency matrix is obtained. Also HA(G), the sum of the Hamming distances between all pairs of strings generated by the adjacency matrix is obtained for some graphs.
