Edge-colorings of some large graphs on alphabets (Q2713603)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Edge-colorings of some large graphs on alphabets |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge-colorings of some large graphs on alphabets |
scientific article |
Statements
10 June 2001
0 references
edge coloring
0 references
chromatic index
0 references
Moore bound
0 references
0.91331935
0 references
0.90569293
0 references
0.90345174
0 references
0.90104306
0 references
0.90059507
0 references
0.89579225
0 references
0.89548194
0 references
Edge-colorings of some large graphs on alphabets (English)
0 references
Graphs on alphabets are constructed by labelling vertices with words of a given alphabet, and by specifying a rule relating pairs of adjacent words (\(=\) vertices). Such constructions can yield graphs of large order for given (large) values of the diameter and the maximum degree \(\Delta \), useful as models of large communication networks. The paper shows optimal edge colorings (with \(\Delta \) colors) for three classes of such graphs: bond graphs, Delorme graphs and \(T(d,k)\) graphs.
0 references