Back to Search
Start Over
A note on the triameter of graphs.
- Source :
-
Discrete Applied Mathematics . Mar2022, Vol. 309, p278-284. 7p. - Publication Year :
- 2022
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *GRAPH connectivity
*STEINER systems
*TREES
Subjects
Details
- Language :
- English
- ISSN :
- 0166218X
- Volume :
- 309
- Database :
- Academic Search Index
- Journal :
- Discrete Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 154617778
- Full Text :
- https://doi.org/10.1016/j.dam.2021.12.011