✦ LIBER ✦

On Vertex Partitions of Hypercubes by Isometric Trees

✍ Scribed by Mollard, Michel

Book ID: 118197923
Publisher: Society for Industrial and Applied Mathematics
Year: 2011
Tongue: English
Weight: 106 KB
Volume: 25
Category: Article
ISSN: 0895-4801
DOI: 10.1137/100814500

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Symmetric vertex partitions of hypercube

Symmetric vertex partitions of hypercubes by isometric trees

✍ Mark Ramras 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 557 KB

Vertex Partitions of Hypercubes into Sym

Vertex Partitions of Hypercubes into Symmetric Snakes

✍ Agung Lukito; A.J. van Zanten 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 351 KB

Note on vertex-partitions of infinite gr

Note on vertex-partitions of infinite graphs

✍ János Pach; Joel H. Spencer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Given an infinite graph G, let deg,(G) be defined as the smallest d for which V(G) can be partitioned into finite subsets of (uniformly) bounded size such that each part is adjacent to at most d others. A countable graph G is constructed with de&(G) > 2 and with the property that [{y~V(G):d(x, y)sn}

On partitions of graphs into trees

✍ F.R.K. Chung 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 934 KB

We crgnsider the minimum m\*-nber T(G) of subsets intl:, which the edge set E(G) of a graph G can lx partitioned so that each subset forms a tree. It is shown that for any connected (3 with II vertices, we always have T( Gj s [$I.

On vertex k-partitions of certain infini

On vertex k-partitions of certain infinite graphs

✍ Douglas Cenzer; Edward Howorka 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 826 KB

Let G be an infinite graph; define de& G to be the least m such that any partition P of the vertex set of G into sets of uniformly bounded cardinality contains a set which is adjacent to at least m Other sets of the partition. If G is either a regular tree 01 a triangtiisr, sqzart or hexagonal plana

Parallel construction of optimal indepen

Parallel construction of optimal independent spanning trees on hypercubes

✍ Jinn-Shyong Yang; Shyue-Ming Tang; Jou-Ming Chang; Yue-Li Wang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 212 KB

The use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides a number of advantages, including the increase of fault-tolerance and bandwidth. Thus, the designs of multiple ISTs on several classes of networks have been widely investigated. Tang et al. [S.-M. Tang,