An independent set or stable set of a graph G V, E is a subset S of the ลฝ . vertices set V in which no two are adjacent. Let G be the number of vertices in ลฝ . a stable set of maximum cardinality; G is called the stability number of G. Stability numbers of a graph have been well studied, but little
โฆ LIBER โฆ
A characterization of separating distinguished collections containing the maximum number of sets
โ Scribed by Jacqueline Shalhevet
- Publisher
- Elsevier Science
- Year
- 1972
- Tongue
- English
- Weight
- 541 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The Cardinality of the Collection of Max
โ
Shu-Chu Chang; Yeong-Nan Yeh
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 226 KB
The Number of Independent Sets in a Grap
โ
David Galvin; Yufei Zhao
๐
Article
๐
2010
๐
Springer Japan
๐
English
โ 180 KB
The maximum number of edges in a 3-graph
โ
F. R. K. Chung; P. Frankl
๐
Article
๐
1987
๐
Springer Japan
๐
English
โ 876 KB
On the maximum number of edges in a hype
โ
J.-C. Bermond; P. Frankl; F. Sterboul
๐
Article
๐
1980
๐
Elsevier Science
๐
English
โ 122 KB
Soit H = (X. ~1 un hypergraphe h-uniforme avec IX] = net soit L h ~(H! le graphe Jont les sommets reprdsentent les arates de H, deux sommets 6lant reli6s si et seulement si t~s z~r6tes qu'ils reprdsen!ent intersectent en h -1 sommet,=. Nous montrons que sif,, t(H) ne contienl pas de cycle, alors I~[
Continuum cardinality of the set of solu
โ
O. V. Kotova
๐
Article
๐
2008
๐
Springer
๐
English
โ 107 KB
A distinct temporal separation of maximu
โ
Koning, Kees ;Dorgelo, Jaap
๐
Article
๐
1982
๐
Springer-Verlag
โ 597 KB