Abstract
We show that the folded halved cubes of diameter d ≥ 5 and the larger folded halved cube of diameter four are uniquely determined by their intersection arrays. This was known before only for d ≥ 8.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. E. Brouwer, A. M. Cohen and A. Neumaier, Distance Regular Graphs, Springer-Verlag, Berlin-Heidelberg-New York (1989).
F. C. Bussemaker and A. Neumaier, Exceptional graphs with smallest eigenvalue −2 and related problems, Math. of Computation, Vol. 59 (1992) pp. 583–608.
K. Metsch, On the characterization of the folded Johnson graphs and the folded halved cubes by their intersection array, Europ. J. Combinatorics, Vol. 18 (1997) pp. 65–74.
K. Metsch, Characterization of the folded Johnson graphs of small diameter by their intersection array, Europ. J. Combinatorics, Vol. 18 (1997) pp. 901–913.
P. Terwilliger, Distance regular graphs with girth 3 or 4, I, J. Combin. Th. (B), Vol. 39 (1985) pp. 265–281.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Metsch, K. On the Characterization of the Folded Halved Cubes by Their Intersection Arrays. Designs, Codes and Cryptography 29, 215–225 (2003). https://doi.org/10.1023/A:1024116811689
Issue Date:
DOI: https://doi.org/10.1023/A:1024116811689