𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connectivity of Matching Graph of Hypercube

✍ Scribed by Fink, Jiří


Book ID
118197005
Publisher
Society for Industrial and Applied Mathematics
Year
2009
Tongue
English
Weight
200 KB
Volume
23
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Matching extension in the powers ofn-con
✍ Walcher, Kara Lee 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 1 views

Let G be a graph on p vertices. Then for a positive integer n, G is said to be n-extendible if (i) TI < p / 2 , iii) G has a set of n independent edges, and (iii) every such set is contained in a perfect matching of G. In this paper we will show that if p is even and G is TIconnected, then Gk is ([$