Accession Number:

ADA169177

Title:

Toughness and Matching Extension in Graphs,

Descriptive Note:

Corporate Author:

VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS

Personal Author(s):

Report Date:

1986-05-01

Pagination or Media Count:

17.0

Abstract:

In the present paper, we wish to treat some relationships between toughness of a graph and the n-extendability of the graph. We will prove two results. The first says essentially that if a graph has sufficiently high toughness and has an even number of points then it must be n-extendable. The second result applies to graphs with toughness less than one and presents an upper bound on the value of n for which such a graph can be n-extendable. In the final section, we compare and contrast these results with the n-factor results of Enomoto, Jackson, Katerinis and A. Saito.

Subject Categories:

  • Numerical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE