Hamming distance between the strings generated by adjacency matrix of a graph and their sum
Vernadsky National Library of Ukraine
Переглянути архів Інформація| Поле | Співвідношення | |
| Title |
Hamming distance between the strings generated by adjacency matrix of a graph and their sum
|
|
| Creator |
Ganagi, A.B.
Ramane, H.S. |
|
| Description |
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.
|
|
| Date |
2019-06-17T11:39:32Z
2019-06-17T11:39:32Z 2016 |
|
| Type |
Article
|
|
| Identifier |
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 назв. — англ.
1726-3255 2010 MSC:05C99. http://dspace.nbuv.gov.ua/handle/123456789/155746 |
|
| Language |
en
|
|
| Relation |
Algebra and Discrete Mathematics
|
|
| Publisher |
Інститут прикладної математики і механіки НАН України
|
|