Name
Abstract | ||
|---|---|---|
To measure the efficiency of a routing in network, Chung et al [The forwarding index of communication networks. IEEE Trans. Inform. Theory, 33 (2) (1987), 224-232] proposed the notion of forwarding index and established an upper bound (n - 1)(n - 2) of this parameter for a connected graph of order n. This note improves this bound as (n - 1)(n 2) - (2n - 2 - Delta [1 + n-1/Delta]) [n-1/Delta], where Delta is the maximum degree of the graph G. This bound is best, possible in the sense that there is a graph G attaining it. |
Year | Venue | Keywords |
|---|---|---|
2007 | ARS COMBINATORIA | forwarding index, routing, path, network |
Field | DocType | Volume |
Discrete mathematics,Graph,Modular decomposition,Combinatorics,Upper and lower bounds,Degree (graph theory),Connectivity,Mathematics | Journal | 83 |
ISSN | Citations | PageRank |
0381-7032 | 1 | 0.35 |
References | Authors | |
2 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jun-ming Xu | 1 | 671 | 53.22 |
| Tao Zhou | 2 | 2744 | 152.77 |
| Ye Du | 3 | 4 | 7.53 |
| Jun Yan | 4 | 13 | 8.90 |