{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:16:25Z","timestamp":1753884985477,"version":"3.41.2"},"reference-count":6,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,5]]},"abstract":"<jats:p> 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]. <\/jats:p>","DOI":"10.1142\/s1793830922501026","type":"journal-article","created":{"date-parts":[[2022,4,28]],"date-time":"2022-04-28T09:43:54Z","timestamp":1651139034000},"source":"Crossref","is-referenced-by-count":1,"title":["Hamming distance between the strings generated by adjacency matrix of a subgraph complementary graph and their sum"],"prefix":"10.1142","volume":"15","author":[{"given":"Swati","family":"Nayak","sequence":"first","affiliation":[{"name":"Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal 576104, India"}]},{"given":"Shankar","family":"Upadhyay","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Maharaja Institute of Technology, Mysore, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2728-6403","authenticated-orcid":false,"given":"Sabitha","family":"D\u2019Souza","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal 576104, India"}]},{"given":"Pradeep G.","family":"Bhat","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal 576104, India"}]}],"member":"219","published-online":{"date-parts":[[2022,6,14]]},"reference":[{"key":"S1793830922501026BIB001","doi-asserted-by":"crossref","first-page":"1859","DOI":"10.1007\/s00453-020-00677-8","volume":"82","author":"Fomin F. V.","year":"2020","journal-title":"Algorithmica"},{"key":"S1793830922501026BIB002","first-page":"82","volume":"22","author":"Ganagi A. B.","year":"2016","journal-title":"Algebra Discrete Math."},{"key":"S1793830922501026BIB003","first-page":"45","volume":"9","author":"Imrich W.","year":"1993","journal-title":"Bull. Inst. Combin. Appl."},{"key":"S1793830922501026BIB004","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1002\/jgt.20084","volume":"49","author":"Klav\u017ear S.","year":"2005","journal-title":"J. Graph Theory"},{"key":"S1793830922501026BIB005","first-page":"25","volume":"10","author":"Pasaribu R. L.","year":"2018","journal-title":"Bull. Math."},{"key":"S1793830922501026BIB006","first-page":"93","volume":"9","author":"Ramane H. S.","year":"2015","journal-title":"Int. J. Math. Sci. Eng. Appl."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T10:37:07Z","timestamp":1682851027000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,14]]},"references-count":6,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["10.1142\/S1793830922501026"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501026","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,6,14]]},"article-number":"2250102"}}