𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Combinatorial properties of generalized hypercube graphs

✍ Scribed by Dyi-Rong Duh; Gen-Huey Chen; D.Frank Hsu

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
406 KB
Volume
57
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Generalized Pigeonhole Properties of Gra
Generalized Pigeonhole Properties of Graphs and Oriented Graphs
✍ Anthony Bonato; Peter J Cameron; Dejan DeliΔ‡; StΓ©phan ThomassΓ© πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 152 KB

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

Highly Fault-Tolerant Routings and Fault
Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs
✍ Koichi Wada; Takaharu Ikeo; Kimio Kawaguchi; Wei Chen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 130 KB

Consider a communication network G in which a limited number of link and/or node faults F might occur. A routing ρ for the network (a fixed path between each pair of nodes) must be chosen without knowing which components might become faulty. The diameter of the surviving route graph R(G, ρ)/F, where

Hereditary properties of combinatorial s
Hereditary properties of combinatorial structures: Posets and oriented graphs
✍ JΓ³zsef Balogh; BΓ©la BollobΓ‘s; Robert Morris πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 247 KB πŸ‘ 1 views

## Abstract A hereditary property of combinatorial structures is a collection of structures (e.g., graphs, posets) which is closed under isomorphism, closed under taking induced substructures (e.g., induced subgraphs), and contains arbitrarily large structures. Given a property $\cal {P}$, we write

Small congestion embedding of graphs int
Small congestion embedding of graphs into hypercubes
✍ Matsubayashi, Akira; Ueno, Shuichi πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 103 KB πŸ‘ 1 views

We consider the problem of embedding graphs into hypercubes with minimal congestion. Kim and Lai showed that for a given N-vertex graph G and a hypercube it is NP-complete to determine whether G is embeddable in the hypercube with unit congestion, but G can be embedded with unit congestion in a hype