- Tytuł:
- Some results concerning the ends of minimal cuts of simple graphs
- Autorzy:
- Jia, Xiaofeng
- Powiązania:
- https://bibliotekanauki.pl/articles/743739.pdf
- Data publikacji:
- 2000
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
cut
fragment
end
interference - Opis:
- Let S be a cut of a simple connected graph G. If S has no proper subset that is a cut, we say S is a minimal cut of G. To a minimal cut S, a connected component of G-S is called a fragment. And a fragment with no proper subset that is a fragment is called an end. In the paper ends are characterized and it is proved that to a connected graph G = (V,E), the number of its ends Σ ≤ |V(G)|.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2000, 20, 1; 139-142
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł