? 2021 Elsevier B.V.In this article, we answer three questions from the paper (Das, 2021). We observe a tight lower bound for the triameter of trees in terms of order and number of leaves. We show that in a connected block graph any triametral triple of vertices contains a diametral pair and that any diametral pair of vertices can be extended to a triametral triple. We also present several open problems concerning the interplay between triametral triples, diametral pairs and peripheral vertices in median and distance-hereditary graphs.
Block graphsDiameterTreesTriameter
Hak A.、Kozerenko S.、Oliynyk B.
展开 >
Department of Mathematics Faculty of Informatics National University of Kyiv-Mohyla Academy
NSTL
Elsevier
