A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The disconnection number of a graph
2011
Topology and its Applications
The disconnection number d( X) is the least number of points in a connected topological graph X such that removal of d( X) points will disconnect X (Nadler, 1993 [6]). Let D n denote the set of all homeomorphism classes of topological graphs with disconnection number n. The main result characterizes the members of D n+1 in terms of four possible operations on members of D n . In addition, if X and Y are topological graphs and X is a subspace of Y with no endpoints, then d( X) d(Y ) and Y
doi:10.1016/j.topol.2010.11.019
fatcat:znrk6g5xebak5hizd3oghw6xfu