𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Matching preclusion for some interconnection networks

✍ Scribed by Eddie Cheng; László Lipták

Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
253 KB
Volume
50
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost‐perfect matchings. In this paper, we find this number for various classes of interconnection networks and classify all the optimal solutions. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 50(2), 173–180 2007

📜 SIMILAR VOLUMES

A Genetic Algorithm for Finding the Page
A Genetic Algorithm for Finding the Pagenumber of Interconnection Networks
✍ Nidhi Kapoor; Mark Russell; Ivan Stojmenovic; Albert Y. Zomaya 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 151 KB

A ''book-embedding'' of a graph G comprises embedding the graph's nodes along the spine of a book and embedding the edges on the pages so that the edges embedded on the same page do not intersect. This is also referred to as the page model. The ''pagenumber'' of a graph is the thickness of the small