Hamming distance between the strings generated by adjacency matrix of a graph and their sum
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)...
Збережено в:
| Дата: | 2016 |
|---|---|
| Автори: | , |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Інститут прикладної математики і механіки НАН України
2016
|
| Назва видання: | Algebra and Discrete Mathematics |
| Онлайн доступ: | http://dspace.nbuv.gov.ua/handle/123456789/155746 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Цитувати: | 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 назв. — англ. |
Репозиторії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| id |
irk-123456789-155746 |
|---|---|
| record_format |
dspace |
| spelling |
irk-123456789-1557462019-06-18T01:25:35Z Hamming distance between the strings generated by adjacency matrix of a graph and their sum Ganagi, A.B. Ramane, H.S. 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. 2016 Article 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 en Algebra and Discrete Mathematics Інститут прикладної математики і механіки НАН України |
| institution |
Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| collection |
DSpace DC |
| language |
English |
| 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. |
| format |
Article |
| author |
Ganagi, A.B. Ramane, H.S. |
| spellingShingle |
Ganagi, A.B. Ramane, H.S. Hamming distance between the strings generated by adjacency matrix of a graph and their sum Algebra and Discrete Mathematics |
| author_facet |
Ganagi, A.B. Ramane, H.S. |
| author_sort |
Ganagi, A.B. |
| title |
Hamming distance between the strings generated by adjacency matrix of a graph and their sum |
| title_short |
Hamming distance between the strings generated by adjacency matrix of a graph and their sum |
| title_full |
Hamming distance between the strings generated by adjacency matrix of a graph and their sum |
| title_fullStr |
Hamming distance between the strings generated by adjacency matrix of a graph and their sum |
| title_full_unstemmed |
Hamming distance between the strings generated by adjacency matrix of a graph and their sum |
| title_sort |
hamming distance between the strings generated by adjacency matrix of a graph and their sum |
| publisher |
Інститут прикладної математики і механіки НАН України |
| publishDate |
2016 |
| url |
http://dspace.nbuv.gov.ua/handle/123456789/155746 |
| citation_txt |
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 назв. — англ. |
| series |
Algebra and Discrete Mathematics |
| work_keys_str_mv |
AT ganagiab hammingdistancebetweenthestringsgeneratedbyadjacencymatrixofagraphandtheirsum AT ramanehs hammingdistancebetweenthestringsgeneratedbyadjacencymatrixofagraphandtheirsum |
| first_indexed |
2023-05-20T17:47:38Z |
| last_indexed |
2023-05-20T17:47:38Z |
| _version_ |
1796154099355353088 |