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 \({\Bbb Z}_2^n\) of all \(n\)-tuples over the field of order two. The Hamming distance between the strings \(s(u)\) and \(s(...
Збережено в:
| Дата: | 2016 |
|---|---|
| Автори: | , |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Lugansk National Taras Shevchenko University
2016
|
| Теми: | |
| Онлайн доступ: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/295 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Algebra and Discrete Mathematics |
Репозитарії
Algebra and Discrete Mathematics| id |
oai:ojs.admjournal.luguniv.edu.ua:article-295 |
|---|---|
| record_format |
ojs |
| spelling |
oai:ojs.admjournal.luguniv.edu.ua:article-2952016-11-15T13:03:03Z Hamming distance between the strings generated by adjacency matrix of a graph and their sum Ganagi, Asha B. Ramane, Harishchandra S. Hamming distance, string, adjacency matrix 05C99 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 \({\Bbb Z}_2^n\) 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 \(H_A(G)\), the sum of the Hamming distances between all pairs of strings generated by the adjacency matrix is obtained for some graphs. Lugansk National Taras Shevchenko University 2016-11-15 Article Article Peer-reviewed Article application/pdf https://admjournal.luguniv.edu.ua/index.php/adm/article/view/295 Algebra and Discrete Mathematics; Vol 22, No 1 (2016) 2415-721X 1726-3255 en https://admjournal.luguniv.edu.ua/index.php/adm/article/view/295/pdf Copyright (c) 2016 Algebra and Discrete Mathematics |
| institution |
Algebra and Discrete Mathematics |
| baseUrl_str |
|
| datestamp_date |
2016-11-15T13:03:03Z |
| collection |
OJS |
| language |
English |
| topic |
Hamming distance string adjacency matrix 05C99 |
| spellingShingle |
Hamming distance string adjacency matrix 05C99 Ganagi, Asha B. Ramane, Harishchandra S. Hamming distance between the strings generated by adjacency matrix of a graph and their sum |
| topic_facet |
Hamming distance string adjacency matrix 05C99 |
| format |
Article |
| author |
Ganagi, Asha B. Ramane, Harishchandra S. |
| author_facet |
Ganagi, Asha B. Ramane, Harishchandra S. |
| author_sort |
Ganagi, Asha 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 |
| 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 \({\Bbb Z}_2^n\) 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 \(H_A(G)\), the sum of the Hamming distances between all pairs of strings generated by the adjacency matrix is obtained for some graphs. |
| publisher |
Lugansk National Taras Shevchenko University |
| publishDate |
2016 |
| url |
https://admjournal.luguniv.edu.ua/index.php/adm/article/view/295 |
| work_keys_str_mv |
AT ganagiashab hammingdistancebetweenthestringsgeneratedbyadjacencymatrixofagraphandtheirsum AT ramaneharishchandras hammingdistancebetweenthestringsgeneratedbyadjacencymatrixofagraphandtheirsum |
| first_indexed |
2025-07-17T10:35:26Z |
| last_indexed |
2025-07-17T10:35:26Z |
| _version_ |
1837890039184359424 |