Displaying similar documents to “Cutwidth of the r -dimensional mesh of d -ary trees”

Two new classes of trees embeddable into hypercubes

Mounira Nekri, Abdelhafid Berrachedi (2004)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much effort has been devoted to determining the conditions under which a graph G is a subgraph of a graph H, having a particular structure. An important class to study is the set of graphs which are embeddable into a hypercube. This importance results from the remarkable properties of the hypercube and its use in several domains, such as: the coding theory, transfer of information, multicriteria...

On graceful trees.

Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)

Applied Mathematics E-Notes [electronic only]

Similarity:

On extremal sizes of locally k -tree graphs

Mieczysław Borowiecki, Piotr Borowiecki, Elżbieta Sidorowicz, Zdzisław Skupień (2010)

Czechoslovak Mathematical Journal

Similarity:

A graph G is a if for any vertex v the subgraph induced by the neighbours of v is a k -tree, k ≥ 0 , where 0 -tree is an edgeless graph, 1 -tree is a tree. We characterize the minimum-size locally k -trees with n vertices. The minimum-size connected locally k -trees are simply ( k + 1 ) -trees. For k ≥ 1 , we construct locally k -trees which are maximal with respect to the spanning subgraph relation. Consequently, the number of edges in an n -vertex locally k -tree graph is between Ω ( n ) and O ( n 2 ) , where both bounds...