✦ LIBER ✦

On the Edge-forwarding Indices of Frobenius Graphs

✍ Scribed by Yan Wang; Xin Gui Fang; D. F. Hsu

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2006
Tongue: English
Weight: 183 KB
Volume: 22
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-005-0833-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Forwarding indices of k-connected graphs

✍ M.C Heydemann; J.C Meyer; J Opatrny; D Sotteau 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 935 KB

On the edge forwarding index problem for

On the edge forwarding index problem for small graphs

✍ Abdelmadjid Bouabdallah; Dominique Sotteau 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 540 KB

The edge-forwarding index of orbital reg

The edge-forwarding index of orbital regular graphs

✍ Patrick Solé 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 351 KB

We define a graph as orbital regular if there is a subgroup of its automorphism group that acts regularly on the set of edges of the graph as well as on all its orbits of ordered pairs of distinct vertices of the graph. For these graphs there is an explicit formula for the edgeforwarding index, an i

Edge-forwarding index of star graphs and

Edge-forwarding index of star graphs and other Cayley graphs

✍ Ginette Gauyacq 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 686 KB

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.

The forwarding diameter of graphs

✍ W.Fernandez De La Vega; M. El Haddad; D. Barraez; O. Ordaz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 641 KB

A routing R in a graph G is a set of paths {RX,, : x, y E V(G)} where, for each ordered pair of vertices (x, y), RXy links x to y. The load <(G, R, x) of a vertex x in the routing R is the number of paths of R for which x is an interior vertex. We define the forwarding diameter p( G, R) of the pair

The forwarding indices of wrapped butter

The forwarding indices of wrapped butterfly networks

✍ Xinmin Hou; Jun-Ming Xu; Min Xu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB

## Abstract Let __G__ be a connected graph. A routing in __G__ is a set of fixed paths for all ordered pairs of vertices in __G__. The forwarding index of __G__ is the minimum of the largest number of paths specified by a routing passing through any vertex of __G__ taken over all routings in __G__.