- Tytuł:
- More on the Minimum Size of Graphs with Given Rainbow Index
- Autorzy:
- Zhao, Yan
- Powiązania:
- https://bibliotekanauki.pl/articles/32083808.pdf
- Data publikacji:
- 2020-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
Steiner distance
rainbow S -tree
k -rainbow index - Opis:
- The concept of k-rainbow index rxk(G) of a connected graph G, introduced by Chartrand et al., is a natural generalization of the rainbow connection number of a graph. Liu introduced a parameter t(n, k, ℓ) to investigate the problems of the minimum size of a connected graph with given order and k-rainbow index at most ℓ and obtained some exact values and upper bounds for t(n, k, ℓ). In this paper, we obtain some exact values of t(n, k, ℓ) for large ℓ and better upper bounds of t(n, k, ℓ) for small ℓ and k = 3.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2020, 40, 1; 227-241
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł