Publication details
OPTIMAL REAL NUMBER GRAPH LABELLINGS OF A SUBFAMILY OF KNESER GRAPHS
| Authors | |
|---|---|
| Year of publication | 2009 |
| Type | Article in Periodical |
| Magazine / Source | SIAM Journal on Discrete Mathematics |
| Citation | |
| Doi | http://dx.doi.org/10.1137/060672923 |
| Keywords | real number graph labelling; channel assignment problem; graph labelling with distance conditions; Kneser graphs |
| Description | A notion of real number graph labellings captures the dependence of the span of an optimal channel assignment on the separations that are required between frequencies assigned to close transmitters. We determine the spans of such optimal labellings for a subfamily of Kneser graphs formed by the complements of the line graphs of complete graphs. This subfamily contains (among others) the Petersen graph. |