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
โฆ LIBER โฆ
Edge-forwarding index of star graphs and other Cayley graphs
โ Scribed by Ginette Gauyacq
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 686 KB
- Volume
- 80
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
โฆ Synopsis
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.
๐ SIMILAR VOLUMES
The edge-forwarding index of orbital reg
โ
Patrick Solรฉ
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 351 KB
On the edge forwarding index problem for
โ
Abdelmadjid Bouabdallah; Dominique Sotteau
๐
Article
๐
1993
๐
John Wiley and Sons
๐
English
โ 540 KB
Edge-colourings characterizing a class o
โ
Marco Buratti
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 244 KB
The chromatic index of graphs with a spa
โ
Mike Plantholt
๐
Article
๐
1981
๐
John Wiley and Sons
๐
English
โ 468 KB
๐ 1 views
## Abstract Vizing's Theorem states that any graph __G__ has chromatic index either the maximum degree ฮ(__G__) or ฮ(__G__) + 1. If __G__ has 2~s~ + 1 points and ฮ(__G__) = 2s, a wellโknown necessary condition for the chromatic index to equal 2~s~ is that __G__ have at most 2s^2^ lines. Hilton conj
The computation of the distance matrix a
โ
Peter Senn
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 952 KB