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
High valency subgraphs of cubes
β Scribed by James Wildon Fickett
- Publisher
- Elsevier Science
- Year
- 1979
- Tongue
- English
- Weight
- 147 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We classify distance-regular graphs that are isometrically embeddable into halved cube graphs.
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
subgraphs as the graph of the It-dimensional cube Q,, (n 2 3), then IV(r)1 b t V(Q,,)j. Moreover, if IV'(f)\ = I VI CI,,)~, f is isomorphic to Q,,.