Distance-regular graphs, MH-colourings and MLD-colourings (Q1377805)
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: Distance-regular graphs, MH-colourings and MLD-colourings |
scientific article; zbMATH DE number 1110061
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Distance-regular graphs, MH-colourings and MLD-colourings |
scientific article; zbMATH DE number 1110061 |
Statements
Distance-regular graphs, MH-colourings and MLD-colourings (English)
0 references
14 May 1998
0 references
A minimal line-distinguishing colouring is a vertex colouring in which each pair of colours occurs exactly once on an edge. In this paper it is shown that the only bipartite distance-regular graphs of diameter three that have a minimal line-distinguishing colouring are the incidence graphs of complementary Hadamard designs.
0 references
minimal line-distinguishing colouring
0 references
distance-regular graphs
0 references
