{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T04:58:20Z","timestamp":1698037100816},"reference-count":3,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6517,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1988,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The distance between a pair of vertices <jats:italic>u, v<\/jats:italic> in a graph <jats:italic>G<\/jats:italic> is the length of a shortest path joining <jats:italic>u<\/jats:italic> and <jats:italic>v<\/jats:italic>. The diameter diam(G) of <jats:italic>G<\/jats:italic> is the maximum distance between all pairs of vertices in <jats:italic>G<\/jats:italic>. A spanning tree <jats:italic>T<\/jats:italic> of <jats:italic>G<\/jats:italic> is diameter preserving if diam(<jats:italic>T<\/jats:italic>) = diam(<jats:italic>G<\/jats:italic>). In this note, we characterize graphs that have diameter\u2010preserving spanning trees.<\/jats:p>","DOI":"10.1002\/jgt.3190120408","type":"journal-article","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T00:47:24Z","timestamp":1181350044000},"page":"525-528","source":"Crossref","is-referenced-by-count":7,"title":["A note on graphs with diameter\u2010preserving spanning trees"],"prefix":"10.1002","volume":"12","author":[{"given":"Fred","family":"Buckley","sequence":"first","affiliation":[]},{"given":"Martin","family":"Lewinter","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Algorithmic Graph Theory","author":"Gibbons A.","year":"1985"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02017925"},{"key":"e_1_2_1_4_2","unstructured":"R.Nandakumar On some eccentricity properties of graphs. Ph.D. thesis Indian Institute of Technology Madras (1986)."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190120408","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190120408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T03:45:56Z","timestamp":1697946356000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190120408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":3,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["10.1002\/jgt.3190120408"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190120408","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}