A note on the triameter of graphs
From MaRDI portal
Publication:2065800
Abstract: In this note, we give answers to three questions from the paper [A. Das, Triameter of graphs, Discuss. Math. Graph Theory, 41 (2021), 601--616]. Namely, we obtain 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.
Recommendations
Cites work
- A Characterization of Block-Graphs
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- A lower bound for radio \(k\)-chromatic number
- A lower bound for radio k-chromatic number of an arbitrary graph
- A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture
- Antipodal number of some powers of cycles
- Distance-hereditary graphs
- Even graphs
- On metric properties of certain clique graphs
- The structure of median graphs
- Triameter of graphs
Cited in
(3)
This page was built for publication: A note on the triameter of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065800)