{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T10:44:07Z","timestamp":1770461047327,"version":"3.49.0"},"reference-count":18,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/G043434\/1"],"award-info":[{"award-number":["EP\/G043434\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2021,3]]},"abstract":"<jats:p> Let [Formula: see text] be an integer. From a set of [Formula: see text]-dimensional vectors, we obtain a [Formula: see text]-dot product graph by letting each vector [Formula: see text] correspond to a vertex [Formula: see text] and by adding an edge between two vertices [Formula: see text] and [Formula: see text] if and only if their dot product [Formula: see text], for some fixed, positive threshold [Formula: see text]. Dot product graphs can be used to model social networks. Recognizing a [Formula: see text]-dot product graph is known to be [Formula: see text]-hard for all fixed [Formula: see text]. To understand the position of [Formula: see text]-dot product graphs in the landscape of graph classes, we consider the case [Formula: see text], and investigate how [Formula: see text]-dot product graphs relate to a number of other known graph classes including a number of well-known classes of intersection graphs. <\/jats:p>","DOI":"10.1142\/s0218195921500011","type":"journal-article","created":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T15:07:53Z","timestamp":1631545673000},"page":"1-16","source":"Crossref","is-referenced-by-count":1,"title":["What Graphs are 2-Dot Product Graphs?"],"prefix":"10.1142","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7295-2663","authenticated-orcid":false,"given":"Matthew","family":"Johnson","sequence":"first","affiliation":[{"name":"Department of Computer Science, Durham University, Durham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5945-9287","authenticated-orcid":false,"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Durham University, Durham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik Jan","family":"van Leeuwen","sequence":"additional","affiliation":[{"name":"Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,9,10]]},"reference":[{"key":"S0218195921500011BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"S0218195921500011BIB002","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1993.3.2.191"},{"key":"S0218195921500011BIB003","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796"},{"key":"S0218195921500011BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6568-7"},{"key":"S0218195921500011BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(97)00049-6"},{"key":"S0218195921500011BIB006","doi-asserted-by":"publisher","DOI":"10.1198\/016214502388618906"},{"key":"S0218195921500011BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2015.01.001"},{"key":"S0218195921500011BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2015.06.095"},{"key":"S0218195921500011BIB009","volume":"18","author":"Kang R. J.","year":"2011","journal-title":"Electr. J. Comb."},{"key":"S0218195921500011BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-012-9394-8"},{"key":"S0218195921500011BIB011","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2012.625257"},{"key":"S0218195921500011BIB012","first-page":"985","volume":"11","author":"Leskovec J.","year":"2010","journal-title":"J. Machine Learning Research"},{"key":"S0218195921500011BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.10.014"},{"key":"S0218195921500011BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/s00180-009-0158-8"},{"key":"S0218195921500011BIB017","doi-asserted-by":"publisher","DOI":"10.1090\/fim\/019"},{"key":"S0218195921500011BIB018","doi-asserted-by":"publisher","DOI":"10.1126\/science.1070120"},{"key":"S0218195921500011BIB019","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77004-6_11"},{"key":"S0218195921500011BIB020","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2008.10129301"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195921500011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T01:52:42Z","timestamp":1635645162000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195921500011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":18,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["10.1142\/S0218195921500011"],"URL":"https:\/\/doi.org\/10.1142\/s0218195921500011","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3]]}}}