{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:11:39Z","timestamp":1759666299240},"reference-count":4,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7894,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1985,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The <jats:italic>k<\/jats:italic>\u2010centrum of a graph <jats:italic>G<\/jats:italic> \u2010 (<jats:italic>V, E<\/jats:italic>)is the set of vertices each minimizing the sum of the distances from it to the corresponding <jats:italic>k<\/jats:italic> farthest vertices of <jats:italic>G<\/jats:italic>. In this article properties of <jats:italic>k<\/jats:italic>\u2010centrum of trees, where edges have positive real lengths, are investigated.<\/jats:p>","DOI":"10.1002\/net.3230150103","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T18:49:31Z","timestamp":1178909371000},"page":"21-25","source":"Crossref","is-referenced-by-count":24,"title":["Properties of the <i>k<\/i>\u2010centra in a tree network"],"prefix":"10.1002","volume":"15","author":[{"given":"G.","family":"Andreatta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. M.","family":"Mason","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Graph Theory: An Algorithm Approach","author":"Christofides N.","year":"1975"},{"key":"e_1_2_1_3_2","volume-title":"Location on Networks: Theory and Algorithms","author":"Handler G. Y.","year":"1979"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190020304"},{"key":"e_1_2_1_5_2","unstructured":"P. J.Slater Structure of the k\u2010Centra in a Tree. Proc. of the Ninth S. E. Conference on Combinatorics Graph Theory and Computing Boca Raton FL (1978)663\u2013670."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230150103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230150103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T15:44:52Z","timestamp":1697816692000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230150103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,3]]}},"alternative-id":["10.1002\/net.3230150103"],"URL":"https:\/\/doi.org\/10.1002\/net.3230150103","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}