# Accession Number:

## ADA248191

# Title:

## The Cartesian Product of a k-Extendable and an l-Extendable Graph is (k + l +1)-Extendable

# Descriptive Note:

# Corporate Author:

## VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS

# Personal Author(s):

# Report Date:

## 1991-01-01

# Pagination or Media Count:

## 10.0

# Abstract:

Let us start with the definition of a kappa-extendable graph G. Suppose kappa is an integer such that 1 or kappa or VG-22. A graph G is kappa-extendable if G is connected, has a perfect matching a 1- factor and any matching in G consisting of kappa edges can be extended to i.e. , is a subset of a perfect matching. The extendability number of G, extG, is the maximum kappa such that G is kappa-extendable. A natural problem is to determine the extendability number of a graph G.

# Descriptors:

# Subject Categories:

- Numerical Mathematics