- Tytuł:
- Decomposition of complete graphs into factors of diameter two and three
- Autorzy:
- Vukicević, Damir
- Powiązania:
- https://bibliotekanauki.pl/articles/743378.pdf
- Data publikacji:
- 2003
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
decomposition
graph - Opis:
- We analyze a minimum number of vertices of a complete graph that can be decomposed into one factor of diameter 2 and k factors of diameter at most 3. We find exact values for k ≤ 4 and the asymptotic value of the ratio of this number and k when k tends to infinity. We also find the asymptotic value of the ratio of the number of vertices of the smallest complete graph that can be decomposed into p factors of diameter 2 and k factors of diameter 3 and number k when p is fixed.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2003, 23, 1; 37-54
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł