{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:20:51Z","timestamp":1757618451900,"version":"3.44.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:00:00Z","timestamp":1750204800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:00:00Z","timestamp":1750204800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s00373-025-02944-3","type":"journal-article","created":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:30:53Z","timestamp":1750231853000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact Decompositions and Zero-Divisor Graphs"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-4969-8127","authenticated-orcid":false,"given":"Justin","family":"Hoffmeier","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,18]]},"reference":[{"key":"2944_CR1","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1155\/2013\/721051","volume":"721051","author":"S Arumugam","year":"2013","unstructured":"Arumugam, S., Hamid, I.S., Abraham, V.M.: Decomposition of graphs into paths and cycles. J. Discrete Math. 721051, 6 (2013). https:\/\/doi.org\/10.1155\/2013\/721051","journal-title":"J. Discrete Math."},{"key":"2944_CR2","doi-asserted-by":"publisher","DOI":"10.1201\/9781003038436","volume-title":"Recent Advancements in Graph Theory","author":"V Kureethara","year":"2020","unstructured":"Kureethara, V., Kok, J.: Recent Advancements in Graph Theory. CRC Press, Boca Raton (2020). https:\/\/doi.org\/10.1201\/9781003038436"},{"key":"2944_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1002\/jgt.23116","volume":"107","author":"J Zeng","year":"2024","unstructured":"Zeng, J., Hou, X.: On induced subgraph of cartesian product of paths. J. Graph Theory 107, 169\u2013180 (2024). https:\/\/doi.org\/10.1002\/jgt.23116","journal-title":"J. Graph Theory"},{"issue":"13","key":"2944_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1186\/1758-2946-4-13","volume":"4","author":"H Ehrlich","year":"2012","unstructured":"Ehrlich, H., Rarey, M.: Systematic benchmark of substructure search in molecular graphs\u2014from Ullmann to VF2. J. ChemInform. 4(13), 143\u2013171 (2012). https:\/\/doi.org\/10.1186\/1758-2946-4-13","journal-title":"J. ChemInform."},{"issue":"2","key":"2944_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1021\/ci00002a008","volume":"31","author":"P Willett","year":"1991","unstructured":"Willett, P., Wilson, T., Reddaway, S.F.: Atom-by-atom searching using massive parallelism. Implementation of the Ullmann subgraph isomorphism algorithm on the distributed array processor. J. Chem. Inf. Comput. Sci. 31(2), 225\u2013233 (1991). https:\/\/doi.org\/10.1021\/ci00002a008","journal-title":"J. Chem. Inf. Comput. Sci."},{"issue":"22","key":"2944_CR6","doi-asserted-by":"publisher","first-page":"19575","DOI":"10.1021\/acsomega.3c01078","volume":"8","author":"M Yamada","year":"2023","unstructured":"Yamada, M., Sugiyama, M.: Molecular graph generation by decomposition and reassembling. ACS Omega 8(22), 19575\u201319586 (2023). https:\/\/doi.org\/10.1021\/acsomega.3c01078","journal-title":"ACS Omega"},{"issue":"5","key":"2944_CR7","doi-asserted-by":"publisher","first-page":"781","DOI":"10.7155\/jgaa.00512","volume":"23","author":"M Kashyop","year":"2019","unstructured":"Kashyop, M., Nagayama, T., Sadakane, K.: Faster algorithms for shortest path and network flow based on graph decomposition. J. Graph Algorithms Appl. 23(5), 781\u2013813 (2019). https:\/\/doi.org\/10.7155\/jgaa.00512","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"2944_CR8","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1006\/jabr.1998.7840","volume":"217","author":"D Anderson","year":"1999","unstructured":"Anderson, D., Livingston, P.: The zero-divisor graph of a commutative ring. J. Algebra 217(2), 434\u2013447 (1999)","journal-title":"J. Algebra"},{"issue":"1","key":"2944_CR9","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0021-8693(88)90202-5","volume":"116","author":"I Beck","year":"1988","unstructured":"Beck, I.: Coloring of commutative rings. J. Algebra 116(1), 208\u2013226 (1988)","journal-title":"J. Algebra"},{"issue":"6","key":"2944_CR10","doi-asserted-by":"publisher","first-page":"4567","DOI":"10.1109\/TSC.2023.3329013","volume":"16","author":"Y Tian","year":"2023","unstructured":"Tian, Y., Li, L., Peng, H., Wang, D., Yang, Y.: Honeywords generation mechanism based on zero-divisor graph sequences. IEEE Trans. Serv. Comput. 16(6), 4567\u20134579 (2023). https:\/\/doi.org\/10.1109\/TSC.2023.3329013","journal-title":"IEEE Trans. Serv. Comput."},{"issue":"2","key":"2944_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1216\/JCA-2016-8-2-143","volume":"8","author":"M Axtell","year":"2016","unstructured":"Axtell, M., Baeth, N., Stickles, J.: Cut structures in zero-divisors graphs of commutative rings. J. Commut. Algebra 8(2), 143\u2013171 (2016). https:\/\/doi.org\/10.1216\/JCA-2016-8-2-143","journal-title":"J. Commut. Algebra"},{"key":"2944_CR12","first-page":"241","volume":"2","author":"J Coykendall","year":"2012","unstructured":"Coykendall, J., Sather-Wagstaff, S., Sheppardson, L., Spiroff, S.: On zero-divisor graphs. Prog. Commut. Algebra 2, 241\u2013249 (2012)","journal-title":"Prog. Commut. Algebra"},{"issue":"7","key":"2944_CR13","doi-asserted-by":"publisher","first-page":"2338","DOI":"10.1080\/00927872.2010.488675","volume":"39","author":"S Spiroff","year":"2011","unstructured":"Spiroff, S., Wickham, C.: A zero divisor graph determined by equivalence classes of zero divisors. Commun. Algebra 39(7), 2338\u20132348 (2011)","journal-title":"Commun. Algebra"},{"issue":"10","key":"2944_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113580","volume":"346","author":"G Arunkumar","year":"2023","unstructured":"Arunkumar, G., Cameron, P., Kavaskar, T., Chelvam, T.T.: Induced subgraphs of zero-divisor graphs. Discrete Math. 346(10), 113580 (2023). https:\/\/doi.org\/10.1016\/j.disc.2023.113580","journal-title":"Discrete Math."},{"key":"2944_CR15","first-page":"1","volume":"16","author":"J Hoffmeier","year":"2022","unstructured":"Hoffmeier, J.: Identifying exact pairs of zero-divisors from zero-divisor graphs of commutative rings. J. Math. Ext. 16, 1\u201315 (2022)","journal-title":"J. Math. Ext."},{"issue":"6","key":"2944_CR16","first-page":"14","volume":"1","author":"P Lalchandani","year":"2016","unstructured":"Lalchandani, P.: Exact zero-divisor graph. Int. J. Sci. Eng. Manag. 1(6), 14\u201317 (2016)","journal-title":"Int. J. Sci. Eng. Manag."},{"issue":"4","key":"2944_CR17","first-page":"91","volume":"6","author":"P Lalchandani","year":"2018","unstructured":"Lalchandani, P.: Exact zero-divisor graph of a commutative ring. Int. J. Math. Appl. 6(4), 91\u201398 (2018)","journal-title":"Int. J. Math. Appl."},{"key":"2944_CR18","volume-title":"Commutative Ring Theory, Cambridge Studies in Advanced Mathematics","author":"H Matsumura","year":"1986","unstructured":"Matsumura, H.: Commutative Ring Theory, Cambridge Studies in Advanced Mathematics, vol. 8. Cambridge University Press, Cambridge (1986)"},{"key":"2944_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.4064\/fm-99-2-113-121","volume":"99","author":"R Kielpinski","year":"1978","unstructured":"Kielpinski, R., Simson, D., Tyc, A.: Exact sequence of pairs in commutative rings. Fundam. Math. 99, 113\u2013121 (1978)","journal-title":"Fundam. Math."},{"issue":"1","key":"2944_CR20","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.jalgebra.2002.10.001","volume":"271","author":"WK Nicholson","year":"2004","unstructured":"Nicholson, W.K., Campos, E.S.: Rings with the dual of the isomorphism theorem. J. Algebra 271(1), 391\u2013406 (2004)","journal-title":"J. Algebra"},{"key":"2944_CR21","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s00209-009-0639-z","volume":"267","author":"I Henriques","year":"2011","unstructured":"Henriques, I., \u015eega, L.: Free resolutions over short Gorenstein local rings. Math. Z. 267, 645\u2013663 (2011)","journal-title":"Math. Z."},{"issue":"4","key":"2944_CR22","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1215\/21562261-2801867","volume":"54","author":"P Bergh","year":"2014","unstructured":"Bergh, P., Celikbas, O., Jorgensen, D.: Homological algebra modulo exact zero-divisors. Kyoto J. Math. 54(4), 879\u2013895 (2014)","journal-title":"Kyoto J. Math."},{"key":"2944_CR23","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.jalgebra.2016.01.016","volume":"453","author":"A Kustin","year":"2016","unstructured":"Kustin, A., Striuli, J., Vraciu, A.: Exact pairs of homogeneous zero divisors. J. Algebra 453, 221\u2013248 (2016)","journal-title":"J. Algebra"},{"key":"2944_CR24","unstructured":"Webber, D.: Zero-divisor graph of z mod n [mathematica] (2022). https:\/\/sites.google.com\/site\/zdgraphsformathematica\/zero-divisor-graphs"},{"key":"2944_CR25","unstructured":"Deltano, M.: Exact zero-divisor graph of z mod n source code. [Mathematica] (2023)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02944-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02944-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02944-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T20:53:52Z","timestamp":1757192032000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02944-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,18]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2944"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02944-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,6,18]]},"assertion":[{"value":"6 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2025","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 author certifies that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"78"}}