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

DOI10.1142/s1793830922501026zbMath1516.05213OpenAlexW4224984698MaRDI QIDQ6132854

Swati Nayak, Pradeep G. Bhat, Unnamed Author, Sabitha D'Souza

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

zbMATH Keywords

Hamming distancestringHamming sumsubgraph complement

Mathematics Subject Classification ID

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

Cites Work

• Subgraph complementation
• Characterizing subgraphs of Hamming graphs
• Unnamed Item
• Unnamed Item

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