EDGEFORWARDINGINDICESOF2-EDGE-CONNECTEDGRAPHS

您当前的位置：

首页 >

文章列表页 >

工程技术 | 更新时间：2026-01-21

- EDGEFORWARDINGINDICESOF2-EDGE-CONNECTEDGRAPHS
- EDGEFORWARDINGINDICESOF2-EDGE-CONNECTEDGRAPHS
- 新疆大学学报（自然科学版中英文） 1990年第4期
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：
  中图分类号：
- 纸质出版：1990
- 稿件说明：
移动端阅览
[1].EDGE FORWARDING INDICES OF 2-EDGE-CONNECTED GRAPHS[J].新疆大学学报(自然科学版),1990(04):11-13.

EDGEFORWARDINGINDICESOF2-EDGE-CONNECTEDGRAPHS[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 1990, (4).
[1].EDGE FORWARDING INDICES OF 2-EDGE-CONNECTED GRAPHS[J].新疆大学学报(自然科学版),1990(04):11-13. DOI：

EDGEFORWARDINGINDICESOF2-EDGE-CONNECTEDGRAPHS[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 1990, (4). DOI：

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

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

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

暂无数据