节点文献

EDGE FORWARDING INDICES OF 2-EDGE-CONNECTED GRAPHS

免费订阅

【Author】 Cai Maocheng (Institute of Systems Science, Acadcmia Sinica, Beijing, China)

【摘要】 <正> For a given graph G of order n, a routing R is a set of n(n—1) elementary paths, one for every ordered pair of distinct vertices in G. Let π(G,R) denote the maximum number of paths of R passing through any edge of G. The edge-forwarding index π(G) is minimum of π(G,R) over all the routings R of G. In this note it is proved that for any 2-edge-connected graph G of order n, which was conjectured by Heydemann et al. in [3].

  • 【下载频次】4
节点文献中: 

本文链接的文献网络图示:

浏览历史:
下载历史: