{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T05:25:19Z","timestamp":1772601919497,"version":"3.50.1"},"reference-count":4,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6614,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1988,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A graph <jats:italic>G<\/jats:italic> is called invertible if its adjacency matrix <jats:italic>A<\/jats:italic> has an inverse which is the adjacency matrix of some graph <jats:italic>H.<\/jats:italic> All such graphs were shown by Harary and Minc to have the form <jats:italic>nK<\/jats:italic><jats:sub>2<\/jats:sub>. We now introduce signed invertible (or briefly s\u2010invertible) graphs <jats:italic>G<\/jats:italic> as those whose inverse <jats:italic>H<\/jats:italic> is a signed graph. We identify two infinite classes of s\u2010invertible graphs: the paths <jats:italic>P<\/jats:italic><jats:sub>2<jats:italic>n<\/jats:italic><\/jats:sub> of even order, and the corona of any graph with K<jats:sub>1<\/jats:sub>. We then characterize s\u2010invertible trees.<\/jats:p>","DOI":"10.1002\/net.3230180302","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T23:23:40Z","timestamp":1178925820000},"page":"151-157","source":"Crossref","is-referenced-by-count":16,"title":["On graphs with signed inverses"],"prefix":"10.1002","volume":"18","author":[{"given":"Fred","family":"Buckley","sequence":"first","affiliation":[]},{"given":"Lynne L.","family":"Doty","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Harary","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1307\/mmj\/1028989917"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/1004057"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.2307\/2689442"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230180302","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230180302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T20:04:20Z","timestamp":1697918660000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230180302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,9]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,9]]}},"alternative-id":["10.1002\/net.3230180302"],"URL":"https:\/\/doi.org\/10.1002\/net.3230180302","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,9]]}}}