vertices are adjacent if they differ in exactly one coordinate. Random induced subgraphs, . with probability . The first theorem shows that for s c ln n rn there exists n n a unique largest component in ⌫ -Q Q n which contains almost all vertices and that n ␣ Ž . the size of the second largest comp
✦ LIBER ✦
On induced subgraphs of the cube
✍ Scribed by F.R.K Chung; Zoltán Füredi; R.L Graham; P Seymour
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 317 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Random Induced Subgraphs of Generalizedn
✍
Christian M. Reidys
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 312 KB
On symmetric subgraphs of the 7-cube: an
✍
Italo J. Dejter
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 661 KB
It is shown that the graph Q(7)-c obtained from the 7-cube Q( 7) by deletion of a perfect Hamming code C has a spanning self-complementary subgraph which is edge-transitive but not vertextransitive and also extremal among all the cube subgraphs which are square-blocking and codeavoiding. Our work us
Largest induced subgraphs of the n-cube
✍
Karen Anne Johnson; Roger Entringer
📂
Article
📅
1989
🏛
Elsevier Science
🌐
English
⚖ 434 KB
High valency subgraphs of cubes
✍
James Wildon Fickett
📂
Article
📅
1979
🏛
Elsevier Science
🌐
English
⚖ 147 KB
Distance regular subgraphs of a cube
✍
Paul M. Weichsel
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 826 KB
Distance-regular Isometric Subgraphs of
✍
S.V. Shpectorov
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 258 KB
We classify distance-regular graphs that are isometrically embeddable into halved cube graphs.