{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T21:03:32Z","timestamp":1767992612800,"version":"3.49.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5676,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0012-365x(97)00034-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"155-166","source":"Crossref","is-referenced-by-count":32,"title":["On the characterization of graphs with maximum number of spanning trees"],"prefix":"10.1016","volume":"179","author":[{"given":"L.","family":"Petingi","sequence":"first","affiliation":[]},{"given":"F.","family":"Boesch","sequence":"additional","affiliation":[]},{"given":"C.","family":"Suffel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00034-4_BIB1","series-title":"Algebraic Graph Theory","author":"Biggs","year":"1974"},{"key":"10.1016\/S0012-365X(97)00034-4_BIB2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230210204","article-title":"On the exsitence of uniformly most reliable networks","volume":"21","author":"Li","year":"1991","journal-title":"Networks"},{"key":"10.1016\/S0012-365X(97)00034-4_BIB3","article-title":"Spectra of Graphs","volume":"vol. 87","author":"Cvetovic","year":"1980"},{"key":"10.1016\/S0012-365X(97)00034-4_BIB4","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/S0095-8956(81)80028-7","article-title":"Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimization design theory","volume":"31","author":"Cheng","year":"1981","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0012-365X(97)00034-4_BIB5","series-title":"Graph Theory","author":"Harary","year":"1971"},{"key":"10.1016\/S0012-365X(97)00034-4_BIB6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0095-8956(74)90065-3","article-title":"A certain polynomial of a graph and graphs with an extremal number of trees","volume":"16","author":"Kelmans","year":"1974","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0012-365X(97)00034-4_BIB7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0012-365X(76)90102-3","article-title":"Comparisons of graphs by their number of spanning trees","volume":"16","author":"Kelmans","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00034-4_BIB8","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0024-3795(94)90486-3","article-title":"Laplacian matrix of graphs: a survey","volume":"198","author":"Merris","year":"1994","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0012-365X(97)00034-4_BIB9","first-page":"193","article-title":"Maximizing the number of spanning trees in a graph with n nodes and m edges","volume":"78 B","author":"Shier","year":"1974","journal-title":"J. Res. Nat. Bureau Standards"},{"key":"10.1016\/S0012-365X(97)00034-4_BIB10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/net.3230240504","article-title":"A proof of Boesch's conjecture","volume":"24","author":"Wang","year":"1994","journal-title":"Networks"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000344?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000344?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T01:27:28Z","timestamp":1555982848000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97000344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":10,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0012365X97000344"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00034-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}