Hamming distance between the strings generated by adjacency matrix of a subgraph complementary graph and their sum
From MaRDI portal
Publication:6132854
Recommendations
- Hamming distance between the strings generated by adjacency matrix of generalised complements of a graph and their sum
- Hamming distance between the strings generated by adjacency matrix of a graph and their sum
- Calculating the degree distance of partial Hamming graphs
- On the Hamming distance in combinatorial optimization problems on hypergraph matchings
- scientific article; zbMATH DE number 2123381
- Distance matrices of subsets of the Hamming cube
- Distance-two labellings of Hamming graphs
- On Hamming distance matrix
- Hamming Distance Completeness
- Hamming distance for conjugates
Cites work
Cited in
(3)
This page was built for publication: Hamming distance between the strings generated by adjacency matrix of a subgraph complementary graph and their sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132854)