✦ LIBER ✦

A characterization of the n-cube by convex subgraphs

✍ Scribed by Patricia Vanden Cruyce

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 212 KB
Volume: 41
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90088-7

No coin nor oath required. For personal study only.

✦ Synopsis

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,,.

📜 SIMILAR VOLUMES

Characterization of the cartesian produc

Characterization of the cartesian product of complete graphs by convex subgraphs

✍ Yoshimi Egawa 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 115 KB

We show that if G is a connected graph with the same proper convex subgraphs as (Kn)', the Cartesian product of r copies of Kn, r >t 2, n >t 3, then [V(G)I ~> n" with equality if and only if G is isomorphic to (Kn)'. In this note we consider only connected finite undirected simple graphs. The compl

Subcube Coverings of Random Spanning Sub

Subcube Coverings of Random Spanning Subgraphs of the n-Cube

✍ Karl Weber 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 896 KB

Let G(n, p ) denote the probability space consisting of all spanning subgraphs g of the n-cube En, and the probability is defined as ERDOS and SPENCER investigated the connectedness of such random graphs for fixed probability p , O<p<l (cf. [l]). I n this paper we study coverings of the vertex set

Asymptotic normality of subcubes in rand

Asymptotic normality of subcubes in random subgraphs of the n-cube

✍ Urzula Konieczna 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 275 KB

We consider two types of random subgraphs of the n-cube. For these models we study the asymptotic behaviour of the number of d-cubes when d = 1,2,

Asymptotic Normality of the Vertex Degre

Asymptotic Normality of the Vertex Degree in Random Subgraphs of the n-Cube

✍ Urszula Konieczna 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB

We consider two types of random subgraphs of the n-cube. For these models we study the asymptotic behaviour of the number of vertices of degree d.

Characterization of a convex obstacle by

Characterization of a convex obstacle by singularities of the scattering kernel

✍ Kazuhiro Yamamoto 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 553 KB

A note on the edges of the n-cube

✍ Sergiu Hart 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 671 KB

The following combinatorial problem, which arose in game theory, is solved here: To tind a selt of vertices of ;P given size (in t.k nxube) which has a maximal number sf interconnecting edges,