Displaying similar documents to “Gromov Minimal Fillings for Finite Metric Spaces”

Some results concerning the ends of minimal cuts of simple graphs

Xiaofeng Jia (2000)

Discussiones Mathematicae Graph Theory

Similarity:

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)|.