Volume 38, Number 4, October-December 2004
|Page(s)||295 - 303|
|Published online||15 December 2004|
Two new classes of trees embeddable into hypercubes
Centre de Recherche en Information
Scientifique et Technique CERIST, 3 rue des frères Aissou, Ben
Aknoun Alger, Algeria; firstname.lastname@example.org, email@example.com.
2 Faculté des Mathématiques, USTHB BP 32 El Alia, 16111 Bab Ezzouar, Alger, Algeria; firstname.lastname@example.org.
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 rule, interconnection networks ... In this paper we are interested in defining two new classes of embedding trees into the hypercube for which the dimension is given.
© EDP Sciences, 2004
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.