The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “On Hamiltonian circuits and spanning trees of hypercubes”

On graceful trees.

Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)

Applied Mathematics E-Notes [electronic only]

Similarity:

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...