{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T10:40:56Z","timestamp":1778582456218,"version":"3.51.4"},"reference-count":22,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":5940,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1990,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let <jats:italic>T<\/jats:italic> be a tree with line graph <jats:italic>T<\/jats:italic>*. Define <jats:italic>K<\/jats:italic> = 2<jats:italic>I<\/jats:italic> + <jats:italic>A<\/jats:italic>(<jats:italic>T<\/jats:italic>*), where <jats:italic>A<\/jats:italic> denotes the adjacency matrix. Then the eigenvalues of \u20102<jats:italic>K<\/jats:italic><jats:sup>\u22121<\/jats:sup> interlace the eigenvalues of the distance matrix <jats:italic>D<\/jats:italic>. This permits numerous results about the spectrum of <jats:italic>K<\/jats:italic> to be transcribed for the less tractable <jats:italic>D<\/jats:italic>.<\/jats:p>","DOI":"10.1002\/jgt.3190140309","type":"journal-article","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T11:52:36Z","timestamp":1181303556000},"page":"365-369","source":"Crossref","is-referenced-by-count":84,"title":["The distance spectrum of a tree"],"prefix":"10.1002","volume":"14","author":[{"given":"Russell","family":"Merris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"5","article-title":"Constructions of telephone networks by group representations","volume":"36","author":"Bien F.","year":"1989","journal-title":"AMS Notices"},{"key":"e_1_2_1_3_2","unstructured":"D.Cvetkovi\u0107 M.Doob I.Gutman andA.Tor\u01e7asev Recent Results in the Theory of Graph Spectra. North\u2010Holland Amsterdam (1988)."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(73)90030-0"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(76)90003-0"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1021\/ma60073a001"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(85)90281-2"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(78)90005-1"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1971.tb02618.x"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1063\/1.435862"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.21136\/CMJ.1973.101168"},{"key":"e_1_2_1_12_2","doi-asserted-by":"crossref","first-page":"607","DOI":"10.21136\/CMJ.1975.101356","article-title":"Eigenvectors of acyclic matrices","volume":"25","author":"Fiedler M.","year":"1975","journal-title":"Czech. Math. J."},{"key":"e_1_2_1_13_2","doi-asserted-by":"crossref","first-page":"660","DOI":"10.21136\/CMJ.1987.102192","article-title":"Algebraic connectivity of trees","volume":"37","author":"Grone R.","year":"1987","journal-title":"Czech. Math. J."},{"key":"e_1_2_1_14_2","first-page":"181","article-title":"Cutpoints, lobes and the spectra of graphs","volume":"45","author":"Grone R.","year":"1988","journal-title":"Port. Math."},{"key":"e_1_2_1_15_2","unstructured":"R.GroneandR.Merris Ordering trees by algebraic connectivity.Graphs and Combinat. to appear."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1137\/0611016"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1080\/03081088908817955"},{"key":"e_1_2_1_18_2","unstructured":"R.Merris The number of eigenvalues greater than two in the Laplacian spectrum of a graph. Submitted."},{"key":"e_1_2_1_19_2","unstructured":"B.Mohar Eigenvalues diameter and mean distance in graphs. Preprint."},{"key":"e_1_2_1_20_2","unstructured":"B.Mohar The Laplacian spectrum of graphs. Preprint."},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0986-40"},{"key":"e_1_2_1_22_2","first-page":"295","volume-title":"Mathematics and Computational Concepts in Chemistry","author":"Rouvray D. H.","year":"1986"},{"key":"e_1_2_1_23_2","unstructured":"W.Watkins unpublished."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190140309","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190140309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T06:10:06Z","timestamp":1698041406000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190140309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,7]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,7]]}},"alternative-id":["10.1002\/jgt.3190140309"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190140309","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,7]]}}}