On the Strong Product of a k-Extendable and an l-Extendable Graph
✍ Scribed by Ervin Győri; Wilfried Imrich
- Publisher
- Springer Japan
- Year
- 2001
- Tongue
- English
- Weight
- 128 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract Let __G__ be a graph on __p__ vertices. Then for a positive integer __n__, __G__ is said to be __n__‐extendible if (i) __n__ < __p__/2, (ii) __G__ has a set of __n__ independent edges, and (iii) every such set is contained in a perfect matching of __G__. The purpose of this article is t
The extended variable precision rough sets model (VPRS l,u ) is a development of the rough set theory methodology first introduced in the seminal work by Zdzislaw Pawlak. As a technique for data analysis it is based on a set theoretical approach for the possible classification of groups of objects (