Hamming distance between the strings generated by adjacency matrix of generalised complements of a graph and their sum (Q5865183)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7540144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamming distance between the strings generated by adjacency matrix of generalised complements of a graph and their sum |
scientific article; zbMATH DE number 7540144 |
Statements
10 June 2022
0 references
Hamming distance
0 references
string
0 references
\(k\)-complement
0 references
\(k(i)\)-complement
0 references
0.9739491939544678
0 references
0.9464210867881776
0 references
0.7185340523719788
0 references
0.7072189450263977
0 references
0.7001108527183533
0 references
