Maximal \(m\)-distance sets containing the representation of the Johnson graph \(J(n,m)\)

DOI10.1016/j.disc.2012.07.028zbMath1252.05150arXiv1202.1352OpenAlexW1761139157MaRDI QIDQ713149

Takahiro Sato, Eiichi Bannai, Junichi Shigezumi

Publication date: 26 October 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.1352

zbMATH Keywords

Johnson graphdistance sets

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Maximal 2-distance sets containing the regular simplex ⋮ The two-distance sets in dimension four ⋮ Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\)

Cites Work

• Maximum planar sets that determine \(k\) distances
• New maximal two-distance sets
• Classification of three-distance sets in two dimensional Euclidean space
• 9-Point and 7-Point Configurations in 3-Space
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximal \(m\)-distance sets containing the representation of the Johnson graph \(J(n,m)\)