{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T07:00:41Z","timestamp":1775718041182,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:00:00Z","timestamp":1770336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:00:00Z","timestamp":1770336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003968","name":"Iran National Science Foundation","doi-asserted-by":"publisher","award":["4043516"],"award-info":[{"award-number":["4043516"]}],"id":[{"id":"10.13039\/501100003968","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003968","name":"Iran National Science Foundation","doi-asserted-by":"publisher","award":["4043516"],"award-info":[{"award-number":["4043516"]}],"id":[{"id":"10.13039\/501100003968","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s00373-026-03011-1","type":"journal-article","created":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T02:43:09Z","timestamp":1770345789000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Classification of Disconnected Graphs with Exactly One Cycle by Their Dot Product Dimension"],"prefix":"10.1007","volume":"42","author":[{"given":"Mahin","family":"Bahrami","sequence":"first","affiliation":[]},{"given":"Dariush","family":"Kiani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,6]]},"reference":[{"issue":"359","key":"3011_CR1","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.dam.2024.08.002","volume":"31","author":"M Bahrami","year":"2024","unstructured":"Bahrami, M., Kiani, D., Bahmani, A.: Dot product dimension of unicyclic graphs. Discret. Appl. Math. 31(359), 196\u2013213 (2024)","journal-title":"Discret. Appl. Math."},{"issue":"04","key":"3011_CR2","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1142\/S0129054124500151","volume":"36","author":"M Bahrami","year":"2025","unstructured":"Bahrami, M., Kiani, D., Rahmati, Z.: An efficient algorithm to compute dot product dimension of some outerplanar graphs. Int. J. Found. Comput. Sci. 36(04), 501\u201316 (2025)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"3011_CR3","unstructured":"Bailey, S.: Dot product graphs and their applications to ecology. Utah State University (2013)"},{"issue":"1\u20133","key":"3011_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0012-365X(97)00049-6","volume":"181","author":"CM Fiduccia","year":"1998","unstructured":"Fiduccia, C.M., Scheinerman, E.R., Trenk, A., Zito, J.S.: Dot product representation of graphs. Discret. Math. 181(1\u20133), 113\u201338 (1998)","journal-title":"Discret. Math."},{"issue":"01","key":"3011_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218195921500011","volume":"31","author":"M Johnson","year":"2021","unstructured":"Johnson, M., Paulusma, D., Van Leeuwen, E.J.: What graphs are 2-dot product graphs? Int. J. Comput. Geom. Appl. 31(01), 1\u20136 (2021)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"3011_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.37236\/703","volume":"18","author":"RJ Kang","year":"2011","unstructured":"Kang, R.J., Lov\u00e1sz, L., M\u00fcller, T., Scheinerman, E.R.: Dot product representations of planar graphs. Electron. J. Combin. 18(1), 216 (2011)","journal-title":"Electron. J. Combin."},{"issue":"3","key":"3011_CR7","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/s00454-012-9394-8","volume":"47","author":"RJ Kang","year":"2012","unstructured":"Kang, R.J., M\u00fcller, T.: Sphere and dot product representations of graphs. Discret. Comput. Geom. 47(3), 548\u201368 (2012)","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"3011_CR8","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/BF01195002","volume":"17","author":"A Kotlov","year":"1997","unstructured":"Kotlov, A., Lov\u00e1sz, L., Vempala, S.: The Colin de Verdiere number and sphere representations of a graph. Combinatorica 17(4), 483\u2013521 (1997)","journal-title":"Combinatorica"},{"issue":"166","key":"3011_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.dam.2013.10.014","volume":"31","author":"BJ Li","year":"2014","unstructured":"Li, B.J., Chang, G.J.: Dot product dimensions of graphs. Discret. Appl. Math. 31(166), 159\u201363 (2014)","journal-title":"Discret. Appl. Math."},{"key":"3011_CR10","unstructured":"Minton, G.: Dot product representations of graphs. PhD dissertation, Harvey Mudd College (2008)"},{"key":"3011_CR11","unstructured":"Nickel, CL.: Random dot product graphs a model for social networks. PhD dissertation, Johns Hopkins University (2008)"},{"issue":"1","key":"3011_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00180-009-0158-8","volume":"25","author":"ER Scheinerman","year":"2010","unstructured":"Scheinerman, E.R., Tucker, K.: Modeling graphs using dot product representations. Comput. Stat. 25(1), 1\u20136 (2010)","journal-title":"Comput. Stat."},{"issue":"5571","key":"3011_CR13","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1126\/science.1070120","volume":"296","author":"DJ Watts","year":"2002","unstructured":"Watts, D.J., Dodds, P.S., Newman, M.E.: Identity and search in social networks. Science 296(5571), 1302\u20135 (2002)","journal-title":"Science"},{"issue":"1\u20132","key":"3011_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/15427951.2008.10129301","volume":"5","author":"SJ Young","year":"2008","unstructured":"Young, S.J., Scheinerman, E.R.: Directed random dot product graphs. Internet Math. 5(1\u20132), 91\u2013111 (2008)","journal-title":"Internet Math."},{"key":"3011_CR15","doi-asserted-by":"crossref","unstructured":"Young, S.J., Scheinerman, E.R.: Random dot product graph models for social networks. In International Workshop on Algorithms and Models for the Web-Graph: 11, pp. 138\u2013149. Springer, Berlin, Heidelberg (2007)","DOI":"10.1007\/978-3-540-77004-6_11"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03011-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03011-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03011-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:16:57Z","timestamp":1775715417000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03011-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,6]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["3011"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03011-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,6]]},"assertion":[{"value":"11 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"18"}}