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

DOI10.1142/S1793830922501026zbMATH Open1516.05213OpenAlexW4224984698MaRDI QIDQ6132854FDOQ6132854

Authors: Swati Nayak, Sabitha D'Souza, Pradeep G. Bhat 

Publication date: 15 July 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830922501026

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

zbMATH Keywords

Hamming distancestringHamming sumsubgraph complement

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90)

Cites Work

• Title not available (Why is that?)
• Characterizing subgraphs of Hamming graphs
• Title not available (Why is that?)
• Subgraph complementation

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)