{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T09:10:09Z","timestamp":1778490609302,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,4,4]],"date-time":"2027-04-04T00:00:00Z","timestamp":1806796800000},"content-version":"am","delay-in-days":246,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.dam.2026.03.043","type":"journal-article","created":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T12:52:29Z","timestamp":1775307149000},"page":"119-125","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On average hitting time and Kemeny\u2019s constant for weighted trees"],"prefix":"10.1016","volume":"389","author":[{"given":"Ji","family":"Zeng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.03.043_b1","series-title":"A graph theoretic interpretation of the mean first passage times","author":"Chebotarev","year":"2007"},{"issue":"2","key":"10.1016\/j.dam.2026.03.043_b2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s11590-018-1314-2","article-title":"Hitting time quasi-metric and its forest representation","volume":"14","author":"Chebotarev","year":"2020","journal-title":"Optim. Lett."},{"issue":"3","key":"10.1016\/j.dam.2026.03.043_b3","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1002\/jgt.22887","article-title":"Forest formulas of discrete Green\u2019s functions","volume":"102","author":"Chung","year":"2023","journal-title":"J. Graph Theory"},{"issue":"12","key":"10.1016\/j.dam.2026.03.043_b4","doi-asserted-by":"crossref","first-page":"2331","DOI":"10.1080\/03081087.2020.1796905","article-title":"On Kemeny\u2019s constant for trees with fixed order and diameter","volume":"70","author":"Ciardo","year":"2022","journal-title":"Linear Multilinear Algebra"},{"issue":"1","key":"10.1016\/j.dam.2026.03.043_b5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10910-021-01294-8","article-title":"A 1-separation formula for the graph Kemeny constant and Braess edges","volume":"60","author":"Faught","year":"2022","journal-title":"J. Math. Chem."},{"key":"10.1016\/j.dam.2026.03.043_b6","series-title":"Finite Markov Chains","author":"Kemeny","year":"1960"},{"key":"10.1016\/j.dam.2026.03.043_b7","doi-asserted-by":"crossref","first-page":"444","DOI":"10.13001\/1081-3810.3222","article-title":"Kemeny\u2019s constant and an analogue of Braess\u2019 paradox for trees","volume":"31","author":"Kirkland","year":"2016","journal-title":"Electron. J. Linear Algebra"},{"issue":"8","key":"10.1016\/j.dam.2026.03.043_b8","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1080\/00029890.2002.11919905","article-title":"Kemeny\u2019s constant and the random surfer","volume":"109","author":"Levene","year":"2002","journal-title":"Am. Math. Mon."},{"issue":"17","key":"10.1016\/j.dam.2026.03.043_b9","doi-asserted-by":"crossref","DOI":"10.1002\/qua.25969","article-title":"Multiplicative degree-Kirchhoff index and number of spanning trees of a zigzag polyhex nanotube TUHC [2n, 2]","volume":"119","author":"Li","year":"2019","journal-title":"Int. J. Quantum Chem."},{"key":"10.1016\/j.dam.2026.03.043_b10","series-title":"Probability on Trees and Networks","author":"Lyons","year":"2017"},{"issue":"12","key":"10.1016\/j.dam.2026.03.043_b11","doi-asserted-by":"crossref","first-page":"3156","DOI":"10.1109\/TAC.2015.2426317","article-title":"Robotic surveillance and Markov chains with minimal weighted Kemeny constant","volume":"60","author":"Patel","year":"2015","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1\u20133","key":"10.1016\/j.dam.2026.03.043_b12","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0012-365X(94)90388-3","article-title":"A partially ordered set of functionals corresponding to graphs","volume":"131","author":"Sidorenko","year":"1994","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001903?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001903?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T08:37:13Z","timestamp":1778488633000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26001903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":12,"alternative-id":["S0166218X26001903"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.043","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On average hitting time and Kemeny\u2019s constant for weighted trees","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.043","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}