Some results concerning the ends of minimal cuts of simple graphs | Zendy

Xiaofeng Jia | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Some results concerning the ends of minimal cuts of simple graphs

Author(s) -

Xiaofeng Jia

Publication year - 2000

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1113

Subject(s) - combinatorics , mathematics , fragment (logic) , connected component , simple (philosophy) , graph , connectivity , simple graph , discrete mathematics , algorithm , philosophy , epistemology

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 also a fragment is called an end. We characterized ends in our discussions and proved that to a connected graph G=(V,E), the number of its ends=|V(G)|.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research