{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T04:04:29Z","timestamp":1744689869230,"version":"3.40.4"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T00:00:00Z","timestamp":1734998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T00:00:00Z","timestamp":1734998400000},"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":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s12190-024-02328-5","type":"journal-article","created":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T14:22:11Z","timestamp":1735050131000},"page":"2589-2610","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The number of maximal dissociation sets in unicyclic graphs"],"prefix":"10.1007","volume":"71","author":[{"given":"Long","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxi","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wai Chee","family":"Shiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,24]]},"reference":[{"key":"2328_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/jgt.21994","volume":"83","author":"M Basavaraju","year":"2016","unstructured":"Basavaraju, M., Heggernes, P., Hof, P.V., Saei, R.Y.: Villanger, maximal induced matchings in triangle-free graphs. J. Graph Theory 83, 231\u2013250 (2016)","journal-title":"J. Graph Theory"},{"key":"2328_CR2","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1016\/j.dam.2011.04.008","volume":"159","author":"B Bresar","year":"2011","unstructured":"Bresar, B., Kardos, F., Katrenic, J., Semanis, G.: Minimum $$k$$-path vertex cover. Discret. Appl. Math. 159, 1189\u20131195 (2011)","journal-title":"Discret. Appl. Math."},{"key":"2328_CR3","doi-asserted-by":"publisher","first-page":"1537","DOI":"10.1016\/j.disc.2015.12.030","volume":"339","author":"S Connolly","year":"2016","unstructured":"Connolly, S., Gabor, Z., Godbole, A., Kay, B., Kelly, T.: Bounds on the maximum number of minimum dominating sets. Discrete Math. 339, 1537\u20131542 (2016)","journal-title":"Discrete Math."},{"key":"2328_CR4","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.ejc.2017.07.015","volume":"68","author":"PA Golovach","year":"2018","unstructured":"Golovach, P.A., Heggernes, P., Kratsch, D.: Enumeration and maximum number of minimal connected vertex covers in graphs. Eur. J. Combin. 68, 132\u2013147 (2018)","journal-title":"Eur. J. Combin."},{"key":"2328_CR5","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/09077850X","volume":"26","author":"S Gupta","year":"2012","unstructured":"Gupta, S., Roman, V., Saurabh, S.: Maximum r-regular induced subgraph problem: fast exponential algorithms and combinatorial bounds. SIAM J. Discret. Math. 26, 1758\u20131780 (2012)","journal-title":"SIAM J. Discret. Math."},{"key":"2328_CR6","first-page":"647","volume":"27","author":"S Sun","year":"2023","unstructured":"Sun, S., Li, S.: On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number. Taiw. J. Math. 27, 647\u2013683 (2023)","journal-title":"Taiw. J. Math."},{"key":"2328_CR7","first-page":"127107","volume":"426","author":"J Tu","year":"2022","unstructured":"Tu, J., Li, Y., Du, J.: Maximal and maximum dissociation sets in general and triangle-free graphs. Appl. Math. Comput. 426, 127107 (2022)","journal-title":"Appl. Math. Comput."},{"key":"2328_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1137\/0607015","volume":"7","author":"H Wilf","year":"1986","unstructured":"Wilf, H.: The number of maximal independent sets in a tree. SIAM J. Alg. Discr. Methods 7, 125\u2013130 (1986)","journal-title":"SIAM J. Alg. Discr. Methods"},{"key":"2328_CR9","first-page":"126","volume":"255","author":"M Xiao","year":"2017","unstructured":"Xiao, M., Nagamochi, H.: Exact algorithms for maximum independent set. Algorithms Comput. 255, 126\u2013146 (2017)","journal-title":"Algorithms Comput."},{"key":"2328_CR10","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.ic.2017.07.006","volume":"256","author":"M Xiao","year":"2017","unstructured":"Xiao, M., Tan, H.: Exact algorithms for maximum induced matching. Inf. Comput. 256, 196\u2013211 (2017)","journal-title":"Inf. Comput."},{"key":"2328_CR11","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1137\/0210022","volume":"10","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Node-deletion problems on bipartite graphs. SIAM J. Comput. 10, 310\u2013327 (1981)","journal-title":"SIAM J. Comput."},{"key":"2328_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/jgt.3190150208","volume":"15","author":"J Zito","year":"1991","unstructured":"Zito, J.: The structure and maximum number of maximum independent sets in trees. J. Graph Theory 15, 207\u2013221 (1991)","journal-title":"J. Graph Theory"},{"key":"2328_CR13","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.dam.2024.01.008","volume":"346","author":"J Zhang","year":"2024","unstructured":"Zhang, J., Qian, J., Huang, S.: Minimum number of maximal dissociation sets in trees. Discret. Appl. Math. 346, 272\u2013278 (2024)","journal-title":"Discret. Appl. Math."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02328-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-024-02328-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02328-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T14:56:40Z","timestamp":1744642600000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-024-02328-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,24]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2328"],"URL":"https:\/\/doi.org\/10.1007\/s12190-024-02328-5","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2024,12,24]]},"assertion":[{"value":"4 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2024","order":4,"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 conflicts of interest to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}