Geodesic
On recursively directed hypercubes
The electronic journal of combinatorics, Tome 9 (2002)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this paper we introduce the recursively directed hypercubes, and analyze some of their structural properties. We show that every recursively directed hypercube is acyclic, and has a unique pair of source and sink nodes. The main contribution of the paper is an analysis of distances between the nodes in such a graph. We show that the distance from the source node to any other node, and from any node to the sink node is bounded by $n+1$, where $n$ is the dimension of the hypercube, but the diameter of a recursively directed hypercube may be exponential in $n$.
DOI : 10.37236/1640
Classification : 05C62, 05C12, 91B08, 05C38
Mots-clés : recursively directed hypercubes, distances, diameter 
@article{10_37236_1640,
     author = {Carmel Domshlak},
     title = {On recursively directed hypercubes},
     journal = {The electronic journal of combinatorics},
     year = {2002},
     volume = {9},
     doi = {10.37236/1640},
     zbl = {0995.05103},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1640/}
}
TY  - JOUR
AU  - Carmel Domshlak
TI  - On recursively directed hypercubes
JO  - The electronic journal of combinatorics
PY  - 2002
VL  - 9
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1640/
DO  - 10.37236/1640
ID  - 10_37236_1640
ER  - 
%0 Journal Article
%A Carmel Domshlak
%T On recursively directed hypercubes
%J The electronic journal of combinatorics
%D 2002
%V 9
%U http://geodesic.mathdoc.fr/articles/10.37236/1640/
%R 10.37236/1640
%F 10_37236_1640
Carmel Domshlak. On recursively directed hypercubes. The electronic journal of combinatorics, Tome 9 (2002). doi: 10.37236/1640

Cité par Sources :