{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:26:31Z","timestamp":1759335991261,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Graham, Hoffman and Hosoya gave a very nice formula about the determinant of the distance matrix $D_G$ of a graph $G$ in terms of the distance matrix of its blocks.  We generalize this result to a $q$-analogue of $D_G$.  Our generalization yields results about the equality of the determinant of the mod-2 (and in general mod-$k$) distance matrix (i.e. each entry of the distance matrix is taken modulo 2 or $k$) of some graphs.  The mod-2 case can be interpreted as a determinant equality result for the adjacency matrix of some graphs.<\/jats:p>","DOI":"10.37236\/470","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T04:13:59Z","timestamp":1578716039000},"source":"Crossref","is-referenced-by-count":3,"title":["A $q$-Analogue of Graham, Hoffman and Hosoya's Theorem"],"prefix":"10.37236","volume":"17","author":[{"given":"Sivaramakrishnan","family":"Sivasubramanian","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2010,4,19]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v17i1n21\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v17i1n21\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T23:54:07Z","timestamp":1579305247000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v17i1n21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,19]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2010,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/470","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2010,4,19]]},"article-number":"N21"}}