A Lloyd theorem in weakly metric association schemes
From MaRDI portal
(Redirected from Publication:2641319)
This paper mainly presents Lloyd theorem in weakly metric association schemes. The theorem covers several schemes e.g. metric scheme on a distance-regular graph, the Lee scheme, the Clark-Liang scheme, the conjugacy scheme as particular cases. Four open problems have also been proposed in the end which might require a good deal of exercise.
Recommendations
Cites work
- A necessary condition for the existence of perfect codes in Lie metric
- Further results on the covering radius of codes
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 4021023 (Why is no real title available?)
- scientific article; zbMATH DE number 4063005 (Why is no real title available?)
- scientific article; zbMATH DE number 3652250 (Why is no real title available?)
- scientific article; zbMATH DE number 3700716 (Why is no real title available?)
- scientific article; zbMATH DE number 3763833 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Perfect codes and regular partitions in graphs and groups
- Perfect codes in graphs
Cited in
(6)
This page was built for publication: A Lloyd theorem in weakly metric association schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641319)