(d, m)-dominating numbers of hypercube
β Scribed by Changhong Lu; Kemin Zhang
- Book ID
- 107500547
- Publisher
- SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
- Year
- 2002
- Tongue
- English
- Weight
- 146 KB
- Volume
- 17
- Category
- Article
- ISSN
- 1005-1031
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The achromatic number of a finite graph G, (G), is the maximum number of independent sets into which the vertex set may be partitioned, so that between any two parts there is at least one edge. For an m-dimensional hypercube P m 2 we prove that there exist constants 0<c 1 <c 2 , independent of m, su
A galaxy is a union of vertex disjoint stars. The galactic number of a graph is the minimum number of galaxies which partition the edge set. The galactic number of complete graphs is determined. This result is used to give bounds on the galactic number of binary cube graphs. The problem of determini