排序方式: 共有2条查询结果,搜索用时 15 毫秒
1
1.
Ginette Gauyacq 《Discrete Applied Mathematics》1997,80(2-3):149-160
We present a technique for building, in some Cayley graphs, a routing for which the load of every edge is almost the same. This technique enables us to find the edge-forwarding index of star graphs and complete-transposition graphs. 相似文献
2.
For a given connected graph G of order v, a routing R in G is a set of v(v−1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forwarding index of G is the maximum number of paths in R passing through any vertex (resp. edge) in G. Shahrokhi and Székely [F. Shahrokhi, L.A. Székely, Constructing integral flows in symmetric networks with application to edge forwarding index problem, Discrete Applied Mathematics 108 (2001) 175-191] obtained an asymptotic formula for the edge forwarding index of n-dimensional cube-connected cycle CCCn as . This paper determines the vertex forwarding index of CCCn as asymptotically. 相似文献
1