- Tytuł:
- Triameter of Graphs
- Autorzy:
- Das, Angsuman
- Powiązania:
- https://bibliotekanauki.pl/articles/32083897.pdf
- Data publikacji:
- 2021-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
distance
radio k -coloring
Nordhaus-Gaddum bounds - Opis:
- 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 attaining those bounds. In the process, we provide some lower bounds of (connected, total) domination numbers of a connected graph in terms of its triameter. The lower bound on total domination number was proved earlier by Henning and Yeo. We provide a shorter proof of that. Moreover, we prove Nordhaus-Gaddum type bounds on tr(G) and find tr(G) for some specific family of graphs.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2021, 41, 2; 601-616
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł