Hamming distance between the strings generated by adjacency matrix of a graph and their sum

• Дата: 2016
• Автори: Ganagi, Asha B., Ramane, Harishchandra S.
• Формат: Стаття
• Мова: English
• Опубліковано: Lugansk National Taras Shevchenko University 2016
• Теми: Hamming distance; string; adjacency matrix; 05C99
• Онлайн доступ: https://admjournal.luguniv.edu.ua/index.php/adm/article/view/295
• Назва журналу: Algebra and Discrete Mathematics

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(...