Triameter of Graphs
In this paper, we study a new distance parameter triameter of a connected graph G, which is defined as max{d(u; v)+d(v;w)+d(u;w) : u; v;w ∈ V }and is denoted by tr(G). We find various upper and lower bounds on tr(G) in terms of order, girth, domination parameters etc., and characterize the graphs at...
| Egile nagusia: | |
|---|---|
| Formatua: | Artikulua |
| Hizkuntza: | English |
| Argitaratua: |
University of Zielona Góra
2021-05-01
|
| Saila: | Discussiones Mathematicae Graph Theory |
| Gaiak: | |
| Sarrera elektronikoa: | https://doi.org/10.7151/dmgt.2212 |