Abstract
Let Γ be a distance-regular graph of diameterd, valencyk andr=max{i|(c i ,b i )=(c 1,b 1)}. In this paper, we prove that
Similar content being viewed by others
References
E. Bannai and T. Ito, Algebraic Combinatorics I, Benjamin-Cummings, California, 1984.
A.E. Brouwer, A.M. Cohen, and A. Neumaier, Distance-Regular Graphs, Springer Verlag, Berlin, Heidelberg, 1989.
A. Boshier and K. Nomura, A remark on the intersection arrays of distance-regular graphs, J. Combin. Theory Ser. B44 (1988) 147–153.
A. Hiraki, Distance-regular subgraphs in a distance-regular graph, I–II, Europ. J. Combin.16 (1995) 589–602, 603–615.
A.A. Ivanov, Bounding the diameter of a distance-regular graph, Soviet Math. Doklady28 (1983) 149–153.
A.V. Ivanov, Problem, In: Algebraic, Extremal and Metrics Combinatorics, 1986, London Math. Soc. Lecture Note Series 131, M-M. Deza, P. Frankl, and I.G. Rosenberg, Eds., Cambridge Univ. Press, Cambridge, 1988, pp. 240–241.
J.H. Koolen, On subgraphs in distance-regular graphs, J. Algebraic Combin.1 (1992) 353–362.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hiraki, A., Koolen, J. An improvement of the Ivanov bound. Annals of Combinatorics 2, 131–135 (1998). https://doi.org/10.1007/BF01608483
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01608483