skip to content
The Cartesian Product of a k-Extendable and an l-Extendable Graph is (k + l +1)-Extendable. Preview this item
ClosePreview this item
Checking...

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

Author: E Gyori; M D Plummer; VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS.
Publisher: Ft. Belvoir : Defense Technical Information Center, 1991.
Edition/Format:   eBook : English
Database:WorldCat
Summary:
Let us start with the definition of a kappa-extendable graph G. Suppose kappa is an integer such that 1 <or = kappa <or = (/V(G)/-2)/2. 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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Internet resource
Document Type: Internet Resource
All Authors / Contributors: E Gyori; M D Plummer; VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS.
OCLC Number: 227778857
Description: 10 p. ; 23 x 29 cm.

Abstract:

Let us start with the definition of a kappa-extendable graph G. Suppose kappa is an integer such that 1 <or = kappa <or = (/V(G)/-2)/2. 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.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227778857>
library:oclcnum"227778857"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227778857>
rdf:typeschema:Book
schema:about
schema:about
schema:bookFormatschema:EBook
schema:contributor
schema:contributor
schema:contributor
schema:datePublished"1991"
schema:description"Let us start with the definition of a kappa-extendable graph G. Suppose kappa is an integer such that 1 "@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/137452572>
schema:inLanguage"en"
schema:name"The Cartesian Product of a k-Extendable and an l-Extendable Graph is (k + l +1)-Extendable."@en
schema:numberOfPages"10"
schema:publisher
schema:url
schema:url<http://handle.dtic.mil/100.2/ADA248191>

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.