{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:37:15Z","timestamp":1743057435336,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496103"},{"type":"electronic","value":"9783031496110"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49611-0_7","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"94-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exactly k MSTs: How Many Vertices Suffice?"],"prefix":"10.1007","author":[{"given":"Apratim","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Muthu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1538-6084","authenticated-orcid":false,"given":"Anuj","family":"Tawari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2348-8742","authenticated-orcid":false,"given":"V.","family":"Sunitha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Azarija, J., \u0160krekovski, R.: Euler\u2019s idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees. Mathematica Bohemica (2012)","key":"7_CR1","DOI":"10.21136\/MB.2013.143285"},{"issue":"16","key":"7_CR2","first-page":"781","volume":"2","author":"ZR Bogdanowicz","year":"2008","unstructured":"Bogdanowicz, Z.R.: Formulas for the number of spanning trees in a fan. Appl. Math. Sci. 2(16), 781\u2013786 (2008)","journal-title":"Appl. Math. Sci."},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/S0095-8956(81)80028-7","volume":"31","author":"CS Cheng","year":"1981","unstructured":"Cheng, C.S.: Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory. J. Comb. Theor. Ser. B 31(2), 240\u2013248 (1981)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"1","key":"7_CR4","first-page":"23","volume":"30","author":"B Gilbert","year":"1997","unstructured":"Gilbert, B., Myrvold, W.: Maximizing spanning trees in almost complete graphs. Netw. Int. J. 30(1), 23\u201330 (1997)","journal-title":"Netw. Int. J."},{"doi-asserted-by":"publisher","unstructured":"Grenet, B., Kaltofen, E.L., Koiran, P., Portier, N.: Symmetric determinantal representation of weakly-skew circuits. In: Schwentick, T., D\u00fcrr, C. (eds.) 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany. LIPIcs, vol.\u00a09, pp. 543\u2013554. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2011). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2011.543","key":"7_CR5","DOI":"10.4230\/LIPIcs.STACS.2011.543"},{"unstructured":"Grenet, B., Monteil, T., Thomass\u00e9, S.: Symmetric determinantal representations in characteristic 2. CoRR abs\/1210.5879 (2012). http:\/\/arxiv.org\/abs\/1210.5879","key":"7_CR6"},{"issue":"1\u20132","key":"7_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<177::AID-RSA11>3.0.CO;2-L","volume":"9","author":"AK Kelmans","year":"1996","unstructured":"Kelmans, A.K.: On graphs with the maximum number of spanning trees. Random Struct. Algorithms 9(1\u20132), 177\u2013192 (1996)","journal-title":"Random Struct. Algorithms"},{"issue":"82","key":"7_CR8","first-page":"4053","volume":"8","author":"R Mokhlissi","year":"2014","unstructured":"Mokhlissi, R., El Marraki, M.: Enumeration of spanning trees in a closed chain of fan and wheel. Appl. Math. Sci. 8(82), 4053\u20134061 (2014)","journal-title":"Appl. Math. Sci."},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.21136\/CPM.1973.117780","volume":"98","author":"L Nebesk\u1ef3","year":"1973","unstructured":"Nebesk\u1ef3, L.: On the minimum number of vertices and edges in a graph with a given number of spanning trees. \u010casopis pro p\u011bstov\u00e1n\u00ed matematiky 98(1), 95\u201397 (1973)","journal-title":"\u010casopis pro p\u011bstov\u00e1n\u00ed matematiky"},{"issue":"1\u20133","key":"7_CR10","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0012-365X(97)00034-4","volume":"179","author":"L Petingi","year":"1998","unstructured":"Petingi, L., Boesch, F., Suffel, C.: On the characterization of graphs with maximum number of spanning trees. Discret. Math. 179(1\u20133), 155\u2013166 (1998)","journal-title":"Discret. Math."},{"issue":"1\u20133","key":"7_CR11","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/S0012-365X(01)00095-4","volume":"244","author":"L Petingi","year":"2002","unstructured":"Petingi, L., Rodriguez, J.: A new technique for the characterization of graphs with a maximum number of spanning trees. Discret. Math. 244(1\u20133), 351\u2013373 (2002)","journal-title":"Discret. Math."},{"unstructured":"Rote https:\/\/mathoverflow.net\/users\/30800\/gwith a prescribed number of spanning trees.MathOverflow. https:\/\/mathoverflow.net\/q\/122093","key":"7_CR12"},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"515","DOI":"10.4153\/CMB-1970-093-0","volume":"13","author":"J Sedl\u00e1\u010dek","year":"1970","unstructured":"Sedl\u00e1\u010dek, J.: On the minimal graph with a given number of spanning trees. Can. Math. Bull. 13(4), 515\u2013517 (1970)","journal-title":"Can. Math. Bull."},{"issue":"193\u2013196","key":"7_CR14","first-page":"3","volume":"78","author":"DR Shier","year":"1974","unstructured":"Shier, D.R.: Maximizing the number of spanning trees in a graph with n nodes and m edges. J. Res. National Bur. Stan. Sect. B 78(193\u2013196), 3 (1974)","journal-title":"J. Res. National Bur. Stan. Sect. B"},{"issue":"2","key":"7_CR15","first-page":"182","volume":"82","author":"R Stong","year":"2022","unstructured":"Stong, R.: Minimal graphs with a prescribed number of spanning trees. Australas. J. Comb. 82(2), 182\u2013196 (2022)","journal-title":"Australas. J. Comb."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49611-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:07:08Z","timestamp":1707556028000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49611-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496103","9783031496110"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49611-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawai, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}