Показати простий запис статті
dc.contributor.author |
Ganagi, A.B. |
|
dc.contributor.author |
Ramane, H.S. |
|
dc.date.accessioned |
2019-06-17T11:39:32Z |
|
dc.date.available |
2019-06-17T11:39:32Z |
|
dc.date.issued |
2016 |
|
dc.identifier.citation |
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 назв. — англ. |
uk_UA |
dc.identifier.issn |
1726-3255 |
|
dc.identifier.other |
2010 MSC:05C99. |
|
dc.identifier.uri |
http://dspace.nbuv.gov.ua/handle/123456789/155746 |
|
dc.description.abstract |
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. |
uk_UA |
dc.description.sponsorship |
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. |
uk_UA |
dc.language.iso |
en |
uk_UA |
dc.publisher |
Інститут прикладної математики і механіки НАН України |
uk_UA |
dc.relation.ispartof |
Algebra and Discrete Mathematics |
|
dc.title |
Hamming distance between the strings generated by adjacency matrix of a graph and their sum |
uk_UA |
dc.type |
Article |
uk_UA |
dc.status |
published earlier |
uk_UA |
Файли у цій статті
Ця стаття з'являється у наступних колекціях
Показати простий запис статті