Graph Theory Concepts in Frequency and Availability Analysis
β Scribed by Kumar, Sudhir; Billinton, Roy
- Book ID
- 117935195
- Publisher
- IEEE
- Year
- 1985
- Tongue
- English
- Weight
- 644 KB
- Volume
- R-34
- Category
- Article
- ISSN
- 0018-9529
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
edge of a graph G is taken as a basic unit, regarded as the set of its two nodes. Two edges are called parallel (or independent) if they are disjoint. Then a l-factor (or perfect matching) of G is a spanning set of parallel edges. A l-factorization of G is a partition of its edge set E(G) into l-fac
## Abstract ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a βFull Textβ option. The original article is trackable v