{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:33:35Z","timestamp":1760060015112,"version":"build-2065373602"},"reference-count":17,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T00:00:00Z","timestamp":1753315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12261071","2025-ZJ-902T"],"award-info":[{"award-number":["12261071","2025-ZJ-902T"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Qinghai Province","award":["12261071","2025-ZJ-902T"],"award-info":[{"award-number":["12261071","2025-ZJ-902T"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>The extremal problem of Laplacian permanents of graphs is a classical and challenging topic in algebraic combinatorics, where the inherent #P-complete complexity of permanent computation renders this pursuit particularly intractable. In this paper, we determine the upper and lower bounds of permanents of Laplacian matrices of unicyclic graphs, and the corresponding extremal graphs are characterized. Furthermore, we also determine the upper and lower bounds of permanents of Laplacian matrices of unicyclic graphs with given girth, and the corresponding extremal graphs are characterized.<\/jats:p>","DOI":"10.3390\/axioms14080565","type":"journal-article","created":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T09:05:12Z","timestamp":1753347912000},"page":"565","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extremal Permanents of Laplacian Matrices of Unicyclic Graphs"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2488-9775","authenticated-orcid":false,"given":"Tingzeng","family":"Wu","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Qinghai Minzu University, Xining 810007, China"},{"name":"Qinghai Institute of Applied Mathematics, Xining 810007, China"}]},{"given":"Xiuhong","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Qinghai Minzu University, Xining 810007, China"}]},{"given":"Xiangshuai","family":"Dong","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Qinghai Minzu University, Xining 810007, China"}]}],"member":"1968","published-online":{"date-parts":[[2025,7,24]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","article-title":"Algebraic connectivity of graphs","volume":"23","author":"Fiedler","year":"1973","journal-title":"Czech. Math. J."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1021\/ma60073a001","article-title":"Configuration statistics of Gaussian molecules","volume":"13","author":"Eichinger","year":"1980","journal-title":"Macromolecules"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1080\/03081089008818029","article-title":"Graph complexity and the Laplacian matrix in blocked experiments","volume":"28","author":"Constantine","year":"1990","journal-title":"Linear Mulitilinear Algebra"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","article-title":"Partitioning sparse matrices with eigenvectors ofgraphs","volume":"11","author":"Pothen","year":"1990","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.jcta.2007.05.010","article-title":"An upper bound for permanents of nonnegative matrices","volume":"115","author":"Samorodnitsky","year":"2008","journal-title":"J. Combin. Theory Ser.A"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.laa.2004.06.022","article-title":"Permanental bounds for nonnegative matrices via decomposition","volume":"394","author":"Soules","year":"2005","journal-title":"Linear Algebra Appl."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0012-365X(99)00048-5","article-title":"Maximizing the permanent at the complementary permanent of (0,1)-matrices with constant line sum","volume":"205","author":"Wanless","year":"1999","journal-title":"Discrete Math."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(84)90127-4","article-title":"Permanent of the Laplacian matrix of trees and bipartite graphs","volume":"48","author":"Brualdi","year":"1984","journal-title":"Discrete Math."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1080\/03081080902765583","article-title":"Further results on permanental bounds for the Laplacian matrix of trees","volume":"58","author":"Geng","year":"2010","journal-title":"Linear Multilinear Algebra"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1423","DOI":"10.1007\/s00373-014-1451-z","article-title":"Permanental bounds of the Laplacian matrix of trees with given domination number","volume":"31","author":"Geng","year":"2015","journal-title":"Graphs Combin."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1080\/03081080903261467","article-title":"Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs","volume":"59","author":"Li","year":"2011","journal-title":"Linear Multilinear Algebra"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s00373-011-1057-7","article-title":"Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter d","volume":"28","author":"Li","year":"2012","journal-title":"Graphs Combin."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"7","DOI":"10.21136\/CMJ.1986.102059","article-title":"The permanent of the Laplacian matrix of a bipartite graph","volume":"36","author":"Vrba","year":"1986","journal-title":"Czech. Math. J."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0024-3795(86)90124-2","article-title":"A bound for the permanent of the Laplacian matrix","volume":"74","author":"Bapat","year":"1986","journal-title":"Linear Algebra Appl."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Wu, T., Dong, X., Lai, H., and Zeng, X. (2025). Solution to an open problem on Laplacian ratio. Front. Math., 1\u201323.","DOI":"10.1007\/s11464-024-0191-5"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.dam.2025.04.047","article-title":"Two problems on Laplacian ratios of trees","volume":"372","author":"Wu","year":"2025","journal-title":"Discrete Appl. Math."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/14\/8\/565\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:15:07Z","timestamp":1760033707000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/14\/8\/565"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,24]]},"references-count":17,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2025,8]]}},"alternative-id":["axioms14080565"],"URL":"https:\/\/doi.org\/10.3390\/axioms14080565","relation":{},"ISSN":["2075-1680"],"issn-type":[{"type":"electronic","value":"2075-1680"}],"subject":[],"published":{"date-parts":[[2025,7,24]]}}}