The edge span of T-coloring on graph \(C^{d}_{n}\) (Q2371031)
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: The edge span of T-coloring on graph C^d_n |
scientific article; zbMATH DE number 5168884
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The edge span of T-coloring on graph \(C^{d}_{n}\) |
scientific article; zbMATH DE number 5168884 |
Statements
The edge span of T-coloring on graph \(C^{d}_{n}\) (English)
0 references
29 June 2007
0 references
T-colorings of graphs arose in connection with the channel assignment problem in communications. The authors find the exact value of the minimum edge span over all T-colorings of the \(d\)th power of the \(n\)-cycle for some parameters.
0 references
T-coloring
0 references
T-chromatic number
0 references
span
0 references
edge span
0 references
0.9111639261245728
0 references
0.8619596362113953
0 references
0.8609688878059387
0 references
0.8550344705581665
0 references
