新疆大学学报(自然科学版)(中英文)

1990, (04) 11-13

[打印本页] [关闭]
本期目录(Current Issue) | 过刊浏览(Past Issue) | 高级检索(Advanced Search)

EDGE FORWARDING INDICES OF 2-EDGE-CONNECTED GRAPHS
EDGE FORWARDING INDICES OF 2-EDGE-CONNECTED GRAPHS

摘要(Abstract):

<正> 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].

关键词(KeyWords):

Abstract:

Keywords:

基金项目(Foundation):

作者(Author):

Email:

DOI:

扩展功能
本文信息
服务与反馈
本文关键词相关文章
本文作者相关文章
中国知网
分享