Abstract
Let [Formula: see text] be the adjacency matrix of a graph [Formula: see text]. Let [Formula: see text] denote the row entries of [Formula: see text] corresponding to the vertex [Formula: see text] of [Formula: see text]. The Hamming distance between the strings [Formula: see text] and [Formula: see text] is the number of positions in which [Formula: see text] and [Formula: see text] differ. In this paper, we study the Hamming distance between the strings generated by the adjacency matrix of subgraph complement of a graph. We also compute sum of Hamming distances between all pairs of strings generated by the adjacency matrix of [Formula: see text].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
