Containment Properties of Product and Power Graphs
✍ Scribed by Antonio Fernéndez; Tom Leighton; Jose Luis Lopez-Presa
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 261 KB
- Volume
- 7
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Expanding and forwarding are two graphic parameters related to the connectivity and the capacity of the network-the undirected graph with a given routing. Many large networks are composed from some existing smaller networks by using, in terms of graph theory, Cartesian product. The expanding and for
A relational structure A satisfies the P(n, k) property if whenever the vertex set of A is partitioned into n nonempty parts, the substructure induced by the union of some k of the parts is isomorphic to A. The P(2, 1) property is just the pigeonhole property, (P), introduced by Cameron, and studied