Hamming distance between the strings generated by adjacency matrix of a graph and their sum (Q2959664)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hamming distance between the strings generated by adjacency matrix of a graph and their sum |
scientific article; zbMATH DE number 6683161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamming distance between the strings generated by adjacency matrix of a graph and their sum |
scientific article; zbMATH DE number 6683161 |
Statements
9 February 2017
0 references
Hamming distance
0 references
string
0 references
adjacency matrix
0 references
0.9464210867881776
0 references
0.9452853202819824
0 references
0.7322482466697693
0 references
0.7233641147613525
0 references
0.702515721321106
0 references
