A network (G, R) consists in a given undirected graph G of order n and a routing R, that is a collection of n(n1) simple paths connecting every ordered pair of vertices of G. Chung, Coffman, Reimanâ€¦ (More)

As it is introduced by Bermond, Prennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs, including most popular models for intercon-nection networks, admit a special automorphism, calledâ€¦ (More)

In this paper, we giae a conslruc2io1~ of embeddings of vertex-congestion 1 and dilaiiou 4 of complete binary trees into star graph,s. The heighl of the trees embedded into th.e n-dimeasloaal starâ€¦ (More)

In this paper we study the existence of cycles of all lengths in the cube-connected cycles graph and we establish that this graph is no far from being pancyclic in case n odd and bi-pancyclic in caseâ€¦ (More)

For an integer k > 2 , the best function m(n, k ) is determined such that every strong digraph of order n with at least m(n, k ) arcs contains a circuit of length k or less.

We use standard terminology. For the sake of clarity, we repeat the most important definitions, otherwise see [3]. A digmph (directed graph) D is a pair (V(D), E(D)) where V(D) is a finite set ofâ€¦ (More)