{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T02:57:41Z","timestamp":1782183461805,"version":"3.54.5"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T00:00:00Z","timestamp":1348617600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s00373-012-1228-1","type":"journal-article","created":{"date-parts":[[2012,9,25]],"date-time":"2012-09-25T20:58:30Z","timestamp":1348606710000},"page":"1647-1652","source":"Crossref","is-referenced-by-count":6,"title":["On Family of Graphs with Minimum Number of Spanning Trees"],"prefix":"10.1007","volume":"29","author":[{"given":"Zbigniew R.","family":"Bogdanowicz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,9,26]]},"reference":[{"key":"1228_CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0012-365X(97)00034-4","volume":"179","author":"F.T. Boesch","year":"1998","unstructured":"Boesch F.T., Pentingi L., Suffel C.L.: On the characterization of graphs with maximum number of spanning trees. Discret. Math. 179, 155\u2013166 (1998)","journal-title":"Discret. Math."},{"key":"1228_CR2","doi-asserted-by":"crossref","first-page":"3074","DOI":"10.1016\/j.disc.2008.08.010","volume":"309","author":"Z.R. Bogdanowicz","year":"2009","unstructured":"Bogdanowicz Z.R.: Undirected simple connected graphs with minimum number of spanning trees. Discret. Math. 309, 3074\u20133082 (2009)","journal-title":"Discret. Math."},{"key":"1228_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230230103","volume":"23","author":"J. Brown","year":"1993","unstructured":"Brown J., Colbourn C., Devitt J.: Network transformations and bounding network reliability. Networks 23, 1\u201317 (1993)","journal-title":"Networks"},{"key":"1228_CR4","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/0097-3165(81)90018-2","volume":"31","author":"C.S. 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. Combin. Theory Ser. 31, 240\u2013248 (1981)","journal-title":"J. Combin. Theory Ser."},{"key":"1228_CR5","doi-asserted-by":"crossref","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":"A.K. Kelmans","year":"1996","unstructured":"Kelmans A.K.: On Graphs with the maximum number of spanning trees. Random Struct. Algorithms 9, 177\u2013192 (1996)","journal-title":"Random Struct. Algorithms"},{"key":"1228_CR6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0095-8956(74)90065-3","volume":"16","author":"A.K. Kelmans","year":"1974","unstructured":"Kelmans A.K., Chelnokov V.M.: A certain polynomial of a graph and graphs with an extremal number of trees. J. Combin. Theory Ser. 16, 197\u2013214 (1974)","journal-title":"J. Combin. Theory Ser."},{"key":"1228_CR7","volume-title":"Threshold Graphs and Related Topics. Annals of Discrete Mathematics, vol 56","author":"N. Mahadev","year":"1995","unstructured":"Mahadev N., Peled V.: Threshold Graphs and Related Topics. Annals of Discrete Mathematics, vol 56. North-Holland, Amsterdam (1995)"},{"key":"1228_CR8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/net.3230220206","volume":"22","author":"A. Satyanarayana","year":"1992","unstructured":"Satyanarayana A., Schoppmann L., Suffel C.L.: A reliability-improving graph transformation with applications to network reliability. Networks. 22, 209\u2013216 (1992)","journal-title":"Networks."},{"key":"1228_CR9","doi-asserted-by":"crossref","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, 351\u2013373 (2002)","journal-title":"Discret. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1228-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1228-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1228-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:34Z","timestamp":1559055574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1228-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,26]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["1228"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1228-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,26]]}}}