Hamming distance between the strings generated by adjacency matrix of a subgraph complementary graph and their sum (Q6132854)
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 subgraph complementary graph and their sum |
scientific article; zbMATH DE number 7713023
| 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 subgraph complementary graph and their sum |
scientific article; zbMATH DE number 7713023 |
Statements
Hamming distance between the strings generated by adjacency matrix of a subgraph complementary graph and their sum (English)
0 references
15 July 2023
0 references
Hamming distance
0 references
Hamming sum
0 references
string
0 references
subgraph complement
0 references
0 references
0.9829284
0 references
0.9779091
0 references
0 references
0.86880404
0 references
0.86714053
0 references
0.86189127
0 references
0 references
0 references
0 references
