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)...
Збережено в:
| Опубліковано в: : | Algebra and Discrete Mathematics |
|---|---|
| Дата: | 2016 |
| Автори: | , |
| Формат: | Стаття |
| Мова: | Англійська |
| Опубліковано: |
Інститут прикладної математики і механіки НАН України
2016
|
| Онлайн доступ: | https://nasplib.isofts.kiev.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| _version_ | 1862722343662518272 |
|---|---|
| author | Ganagi, A.B. Ramane, H.S. |
| author_facet | Ganagi, A.B. Ramane, H.S. |
| 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 назв. — англ. |
| collection | DSpace DC |
| container_title | Algebra and Discrete Mathematics |
| 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.
|
| first_indexed | 2025-12-07T18:34:53Z |
| format | Article |
| fulltext | |
| id | nasplib_isofts_kiev_ua-123456789-155746 |
| institution | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| issn | 1726-3255 |
| language | English |
| last_indexed | 2025-12-07T18:34:53Z |
| publishDate | 2016 |
| publisher | Інститут прикладної математики і механіки НАН України |
| record_format | dspace |
| spelling | Ganagi, A.B. Ramane, H.S. 2019-06-17T11:39:32Z 2019-06-17T11:39:32Z 2016 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. https://nasplib.isofts.kiev.ua/handle/123456789/155746 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. 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. en Інститут прикладної математики і механіки НАН України Algebra and Discrete Mathematics Hamming distance between the strings generated by adjacency matrix of a graph and their sum Article published earlier |
| spellingShingle | Hamming distance between the strings generated by adjacency matrix of a graph and their sum Ganagi, A.B. Ramane, H.S. |
| title | 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_short | 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 |
| url | https://nasplib.isofts.kiev.ua/handle/123456789/155746 |
| work_keys_str_mv | AT ganagiab hammingdistancebetweenthestringsgeneratedbyadjacencymatrixofagraphandtheirsum AT ramanehs hammingdistancebetweenthestringsgeneratedbyadjacencymatrixofagraphandtheirsum |