Some results concerning the ends of minimal cuts of simple graphs

• Autorzy: Xiaofeng Jia
• Języki publikacji: EN

Abstrakty

EN

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

Słowa kluczowe

EN

cut; fragment; end; interference

Kategorie tematyczne

• 05C35: Extremal problems
• 05C40: Connectivity

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2000
• Tom: 20
• Numer: 1
• Strony: 139-142

Daty

wydano

2000

otrzymano

1999-10-14

poprawiono

2000-02-24

Twórcy

autor

Xiaofeng Jia

• Department of Mathematics, Taiyuan University of Technology (West Campus), Taiyuan, Shanxi, P.R. China 030024

Bibliografia

• [1] B. Bollobas, Extremal Graph Theory (Academic Press, New York, 1978).
• [2] H. Veldman, Non k-Critical Vertices in Graphs, Discrete Math. 44 (1983) 105-110, doi: 10.1016/0012-365X(83)90009-2.

Identyfikatory

DOI

10.7151/dmgt.1113