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

• Опубліковано в: : Algebra and Discrete Mathematics
• Дата: 2016
• Автори: Ganagi, A.B., Ramane, H.S.
• Формат: Стаття
• Мова: Англійська
• Опубліковано: Інститут прикладної математики і механіки НАН України 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 назв. — англ.

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