The paper presents a new construction of crossed products of C\*-algebras d and group duals (of compact groups) acting on d using a suitable d-left module as the starting object.
On the Nash-Williams′ Lemma in Graph Reconstruction Theory
✍ Scribed by B.D. Thatte
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 382 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
✦ Synopsis
A generalization of Nash-Williams' lemma is proved for the structure of (m)-uniform null ( (m-k) )-designs. It is then applied to various graph reconstruction problems. A short combinatorial proof of the edge reconstructibility of digraphs having regular underlying undirected graphs (e.g., tournaments) is given. A type of Nash-Williams' lemma is conjectured for the vertex reconstruction problem.
(c) 1993 Academic Press, Inc.
📜 SIMILAR VOLUMES
## Abstract Suppose that __G, H__ are infinite graphs and there is a bijection Ψ; V(G) Ψ V(H) such that __G__ ‐ ξ ≅ H ‐ Ψ(ξ) for every ξ ∼ __V__(G). Let __J__ be a finite graph and /(π) be a cardinal number for each π ≅ __V__(J). Suppose also that either /(π) is infinite for every π ≅ __V__(J) or _
## Abstract Recent research has shown that Lighthill–Ford spontaneous gravity wave generation theory, when applied to numerical model data, can help predict areas of clear‐air turbulence. It is hypothesized that this is the case because spontaneously generated atmospheric gravity waves may initiate