{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:57:10Z","timestamp":1760245030552},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1987,6]]},"DOI":"10.1007\/bf02579450","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T17:10:40Z","timestamp":1174583440000},"page":"205-214","source":"Crossref","is-referenced-by-count":17,"title":["Maximum andk-th maximal spanning trees of a weighted graph"],"prefix":"10.1007","volume":"7","author":[{"given":"M.","family":"Kano","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579450_CR1","volume-title":"Graph Theory with Applications to Engineering and Computer Science","author":"N. Deo","year":"1974","unstructured":"N. Deo,Graph Theory with Applications to Engineering and Computer Science, Printice-Hall, New Jersey, 1974."},{"key":"BF02579450_CR2","volume-title":"Flows in Networks","author":"L. R. Ford","year":"1962","unstructured":"L. R. Ford andD. R. Fulkerson,Flows in Networks, Princeton University Press, New Jersey, 1962."},{"key":"BF02579450_CR3","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/TCT.1960.1086621","volume":"CT-7","author":"S. L. Hakimi","year":"1960","unstructured":"S. L. Hakimi andW. Maeda, On coefficients of polynomials in network function,IRE Trans. Circuit Theory, CT-7 (1960), 40\u201344.","journal-title":"IRE Trans. Circuit Theory"},{"key":"BF02579450_CR4","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"P. Hall, On representatives of subsets,J. London Math. Soc.,10 (1935), 26\u201330.","journal-title":"J. London Math. Soc."},{"key":"BF02579450_CR5","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/TCT.1971.1083291","volume":"18","author":"Y. Kajitani","year":"1971","unstructured":"Y. Kajitani, Graph theoretical properties of the node determinant of an LCR network,IEEE Trans. Circuit Theory, CT-18 (1971), 343\u2013350.","journal-title":"IEEE Trans. Circuit Theory, CT"},{"key":"BF02579450_CR6","first-page":"988","volume":"61-A","author":"T. Kawamoto","year":"1978","unstructured":"T. Kawamoto, Y. Kajitani andS. Shinoda, On the second maximal trees of a weighted graph (in Japanese).Trans. IECE of Japan,61-A (1978), 988\u2013995.","journal-title":"Trans. IECE of Japan"},{"key":"BF02579450_CR7","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J. B. Kruskal","year":"1956","unstructured":"J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem,Proc. Amer. Math. Soc.,7 (1956), 48\u201350.","journal-title":"Proc. Amer. Math. Soc."},{"key":"BF02579450_CR8","first-page":"604","volume":"61-A","author":"E. Okamoto","year":"1978","unstructured":"E. Okamoto andY. Kajitani, A class of trees that determines a weighted graph (in Japanese),Trans. IECE of Japan,61-A (1978), 604\u2013610.","journal-title":"Trans. IECE of Japan"},{"key":"BF02579450_CR9","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R. C. Prim","year":"1957","unstructured":"R. C. Prim, Shortest connection networks and some generalizations,Bell System Tech. J.,36 (1957), 1389\u20131401.","journal-title":"Bell System Tech. J."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579450.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579450\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579450","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:45:04Z","timestamp":1558183504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579450"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["BF02579450"],"URL":"https:\/\/doi.org\/10.1007\/bf02579450","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}