Article
Cited 8 time in 
Cited 8 time in 
Cited 8 time in
Metadata Downloads
Improving diameter bounds for distance-regular graphs SCIE SCOPUS
- Title
- Improving diameter bounds for distance-regular graphs
- Authors
- Bang, S; Hiraki, A; Koolen, JH
- Date Issued
- 2006-01
- Publisher
- ACADEMIC PRESS LTD ELSEVIER SCIENCE L
- Abstract
- In this paper we study the sequence (c(i))(0 <= i <= d) for a distance-regular graph. In particular we show that if d >= 2j and cj > 1 then c(2j-1) > c(j) bolds. Using this we give improvements on diameter bounds by A. Hiraki, J.H. Koolen [An improvement of the Ivanov bound, Ann. Comb. 2 (2) (1998) 131-135], and L. Pyber [A bound for the diameter of distance-regular graphs, Combinatorica 19 (4) (1999) 549-553], respectively, by applying this inequality. (c) 2004 Elsevier Ltd. All rights reserved.
- ISSN
- 0195-6698
- Article Type
- Article
- Citation
- EUROPEAN JOURNAL OF COMBINATORICS, vol. 27, no. 1, page. 79 - 89, 2006-01
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Communities & Collection
Related Researcher
- Koolen Jacobus H.KOOLEN, JACOBUS H
- Dept of Mathematics