Isolated Toughness and Fractional k-Deleted Graphs
Y Uiying · Or Transactions · 2003
A graph G is fractional k-deleted if there exists a fractional k-factor after deleting any edge of G. The isolated toughness 7(G) is defined as follows: If G is a complete graph, then 7(G) = +∞; else, I(G) = min, where i(G - S) denotes the number of isolated vertices in G - S. In this paper, it is proved that G is fractional k-deleted if δ(G) (?) k + 1 and I(G) k. We also proved that our result is best possible.