✦ 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
DOI: 10.1137/070697288

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Connectivity measures in matched sum gra

Connectivity measures in matched sum graphs

✍ C. Balbuena; P. García-Vázquez; X. Marcote 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 199 KB

Graph search algorithms and maximum bipa

Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model

✍ Jang-Ping Sheu; Nan-Ling Kuo; Gen-Huey Chen 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 648 KB

The Algebraic Connectivity of Graphs wit

The Algebraic Connectivity of Graphs with Given Matching Number

✍ Bao-Xuan Zhu 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 227 KB

Super connectivity of balanced hypercube

Super connectivity of balanced hypercubes

✍ Ming-Chien Yang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 382 KB

Matching extension in the powers ofn-con

Matching extension in the powers ofn-connected graphs

✍ 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 ([$

The connectivity of Z-transformation gra

The connectivity of Z-transformation graphs of perfect matchings of polyominoes

✍ Heping Zhang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 949 KB