{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T14:54:21Z","timestamp":1776437661153,"version":"3.51.2"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100007780","name":"Indian Institute of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007780","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005276","name":"National Board for Higher Mathematics","doi-asserted-by":"publisher","award":["0204\/31\/2024\/R&D-II\/14685"],"award-info":[{"award-number":["0204\/31\/2024\/R&D-II\/14685"]}],"id":[{"id":"10.13039\/501100005276","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.dam.2026.03.010","type":"journal-article","created":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T09:18:10Z","timestamp":1773307090000},"page":"172-180","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Maximizing adjacency determinant over\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" id=\"d1e321\" altimg=\"si257.svg\">\n                      <mml:mi>k<\/mml:mi>\n                    <\/mml:math>\n                    -cyclic graphs with a unique perfect matching: A complete characterization"],"prefix":"10.1016","volume":"387","author":[{"given":"Kuldeep","family":"Sarma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.dam.2026.03.010_b1","first-page":"9","article-title":"Determinants of adjacency matrices of graphs","volume":"1","author":"Abdollahi","year":"2012","journal-title":"Trans. Comb."},{"issue":"1","key":"10.1016\/j.dam.2026.03.010_b2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.laa.2006.10.017","article-title":"On unimodular graphs","volume":"421","author":"Akbari","year":"2007","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.03.010_b3","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/j.laa.2022.03.020","article-title":"Maximum determinant and permanent of sparse 0\u22121 matrices","volume":"645","author":"Araujo","year":"2022","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.03.010_b4","first-page":"89","article-title":"A formula for all minors of the adjacency matrix and an application","volume":"2","author":"Bapat","year":"2014","journal-title":"Spec. Matrices"},{"key":"10.1016\/j.dam.2026.03.010_b5","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1080\/03081087.2013.779268","article-title":"On the adjacency matrix of a block graph","volume":"62","author":"Bapat","year":"2014","journal-title":"Linear Multilinear Algebra"},{"key":"10.1016\/j.dam.2026.03.010_b6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.dam.2023.12.008","article-title":"On unimodular graphs with a unique perfect matching","volume":"346","author":"Basumatary","year":"2024","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.010_b7","doi-asserted-by":"crossref","first-page":"2446","DOI":"10.1016\/j.disc.2013.07.006","article-title":"On the determinant of bipartite graphs","volume":"313","author":"Bibak","year":"2013","journal-title":"Discrete Math."},{"issue":"6","key":"10.1016\/j.dam.2026.03.010_b8","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1080\/00029890.1972.11993099","article-title":"The Hadamard maximum determinant problem","volume":"79","author":"Brenner","year":"1972","journal-title":"Am. Math. Mon."},{"key":"10.1016\/j.dam.2026.03.010_b9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.laa.2018.04.030","article-title":"Maximal determinants of combinatorial matrices","volume":"553","author":"Bruhn","year":"2018","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.03.010_b10","series-title":"Spectra of Graphs","author":"Cvetkov\u0301ic","year":"1979"},{"key":"10.1016\/j.dam.2026.03.010_b11","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0095-8956(83)90054-0","article-title":"On the determinant of the adjacency matrix for a planar sublattice","volume":"35","author":"Deift","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.03.010_b12","unstructured":"D.K. Faddeev, I.S. Sominskii, Problems in Higher Algebra, Freeman, San Francisco, p. 1965."},{"issue":"4","key":"10.1016\/j.dam.2026.03.010_b13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1080\/03081089708818506","article-title":"Maximum determinant of (0,1) matrices with certain constant row and column sums","volume":"42","author":"Fallat","year":"1997","journal-title":"Linear Multilinear Algebra"},{"issue":"3","key":"10.1016\/j.dam.2026.03.010_b14","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1090\/S0002-9939-1965-0175925-4","article-title":"A bound on determinants","volume":"16","author":"Frank","year":"1965","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/j.dam.2026.03.010_b15","first-page":"133","article-title":"The determinant of the adjacency matrix of the graph of a conjugated molecule","volume":"51","author":"Graovac","year":"1978","journal-title":"Croat. Chem. Acta"},{"key":"10.1016\/j.dam.2026.03.010_b16","first-page":"853","article-title":"Computing the determinant and the algebraic structure count in polygraphs","volume":"72","author":"Graovac","year":"1999","journal-title":"Croat. Chem. Acta"},{"key":"10.1016\/j.dam.2026.03.010_b17","first-page":"240","article-title":"R\u00e9solution d\u2019une question relative aux d\u00e9terminants","volume":"2","author":"Hadamard","year":"1893","journal-title":"Bull. Des Sci. Math"},{"key":"10.1016\/j.dam.2026.03.010_b18","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1137\/1004057","article-title":"The determinant of the adjacency matrix of a graph","volume":"4","author":"Harary","year":"1962","journal-title":"SIAM Rev."},{"key":"10.1016\/j.dam.2026.03.010_b19","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/j.laa.2023.08.007","article-title":"Adjacency matrices over a finite prime field and their direct sum decompositions","volume":"677","author":"Higashitani","year":"2023","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.03.010_b20","first-page":"931","article-title":"On the determinant of the adjacency matrix of a type of plane bipartite graphs","volume":"68","author":"Huang","year":"2012","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"10.1016\/j.dam.2026.03.010_b21","first-page":"395","article-title":"On tetracyclic graphs with minimal energy","volume":"60","author":"Li","year":"2008","journal-title":"MATCH Commun. Math. Comput. Chem."},{"issue":"2","key":"10.1016\/j.dam.2026.03.010_b22","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1214\/aoms\/1177706253","article-title":"Some optimum weighing designs","volume":"30","author":"Raghavarao","year":"1959","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/j.dam.2026.03.010_b23","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1214\/aoms\/1177705664","article-title":"Some aspects of weighing designs","volume":"31","author":"Raghavarao","year":"1960","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/j.dam.2026.03.010_b24","doi-asserted-by":"crossref","first-page":"128","DOI":"10.2307\/2983576","article-title":"Factorial experiments derivable from combinatorial arrangements of arrays","volume":"9","author":"Rao","year":"1947","journal-title":"Suppl. J. Stat. Soc."},{"key":"10.1016\/j.dam.2026.03.010_b25","doi-asserted-by":"crossref","first-page":"245","DOI":"10.4153\/CJM-1956-028-4","article-title":"Maximal determinants in combinatorial investigations","volume":"8","author":"Ryser","year":"1956","journal-title":"Canad. J. Math."},{"key":"10.1016\/j.dam.2026.03.010_b26","series-title":"Maximal determinants of sparse zero\u2013one matrices","author":"Scheinerman","year":"2019"},{"key":"10.1016\/j.dam.2026.03.010_b27","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.laa.2018.05.019","article-title":"On the determinant of a sparse 0\u22121 matrix","volume":"554","author":"Shitov","year":"2018","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.03.010_b28","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/j.laa.2016.10.020","article-title":"Graph invertibility and median eigenvalues","volume":"513","author":"Ye","year":"2017","journal-title":"Linear Algebra Appl."},{"issue":"10","key":"10.1016\/j.dam.2026.03.010_b29","doi-asserted-by":"crossref","first-page":"1327","DOI":"10.1016\/j.aml.2011.11.038","article-title":"The number of independent sets of tricyclic graphs","volume":"25","author":"Zhu","year":"2012","journal-title":"Appl. Math. Lett."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001526?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001526?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T14:07:53Z","timestamp":1776434873000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26001526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":29,"alternative-id":["S0166218X26001526"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.010","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Maximizing adjacency determinant over -cyclic graphs with a unique perfect matching: A complete characterization","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.010","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}