Paper Info
Title
Some results concerning the ends of minimal cuts of simple graphs.
Abstract
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)|.
Year
DOI
Venue
2000
10.7151/dmgt.1113
Discussiones Mathematicae - Graph Theory
Keywords
DocType
Volume
interference,cut,end
Journal
20
Issue
Citations 
PageRank 
1
0
0.34
References 
Authors
0
1
Name
Order
Citations
PageRank
Xiaofeng Jia1448.75