On the edge forwarding index problem for small graphs | Zendy

Bouabdallah Abdelmadjid | Zendy; Sotteau Dominique | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

On the edge forwarding index problem for small graphs

Author(s) -

Bouabdallah Abdelmadjid,

Sotteau Dominique

Publication year - 1993

Publication title -

networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.977

H-Index - 64

eISSN - 1097-0037

pISSN - 0028-3045

DOI - 10.1002/net.3230230406

Subject(s) - combinatorics , enhanced data rates for gsm evolution , graph , mathematics , computer science , routing (electronic design automation) , set (abstract data type) , order (exchange) , discrete mathematics , computer network , telecommunications , programming language , finance , economics

For a given graph G of order n , a routing R is a set of n ( n − 1) elementary paths specified for every ordered pair of vertices in G . The edge forwarding index of a network (G,R) , denoted π (G,R) is the maximum number of paths of R going through any edge e of G . The edge forwarding index of G , denoted π (G) , is the minimum of π (G,R) taken over all the possible routings R of G . Given n ≤ 15 and Δ ≤ n − 1 we determine π Δ, n , the minimum of π (G) taken over all graphs G of order n with maximum degree at most Δ. This is known as the edge forwarding index problem. © 1993 by John Wiley & Sons, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research