✦ LIBER ✦
Graphs which have n/2-minimal line-distinguishing colourings
✍ Scribed by B.E. Brunton; B.J. Wilson; T.S. Griggs
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 436 KB
- Volume
- 155
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
A graph G is said to be k-MLD-colourable if G possesses a k-vertex colouring such that each pair ofcolours appears on precisely one edge of G. Given G with n vertices and valency sequence S which is n/2-MLD-colourable it is shown how any other graph on n vertices with valency sequence S can be obtained. For each p >/1 a p-regular n/2-MLD-colourable graph is constructed and for p = 3, 5 and p/> 7 such a graph having diameter 2 is found.