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

zbMATH Open1355.05096MaRDI QIDQ2959664FDOQ2959664

Authors Asha B. Ganagi, Harishchandra S. Ramane 

Publication date 9 February 2017

zbMATH Keywords

Hamming distanceadjacency matrixstring

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph theory (05C99)

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 subgraph complementary graph and their sum
• On Hamming distance matrix
• Sets with maximum hamming index
• Calculating the degree distance of partial Hamming graphs

Cited in

(4)

• Hamming distance for conjugates
• On Hamming distance matrix
• Hamming distance between the strings generated by adjacency matrix of a subgraph complementary graph and their sum
• Hamming distance between the strings generated by adjacency matrix of generalised complements of a graph and their sum

This page was built for publication: Hamming distance between the strings generated by adjacency matrix of a graph and their sum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959664)