DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bang S. | ko |
dc.contributor.author | Hiraki A. | ko |
dc.contributor.author | Koolen J.H. | ko |
dc.date.accessioned | 2013-03-07T00:38:40Z | - |
dc.date.available | 2013-03-07T00:38:40Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | EUROPEAN JOURNAL OF COMBINATORICS, v.27, no.1, pp.79 - 89 | - |
dc.identifier.issn | 0195-6698 | - |
dc.identifier.uri | http://hdl.handle.net/10203/88961 | - |
dc.description.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. | - |
dc.language | English | - |
dc.publisher | ACADEMIC PRESS LTD ELSEVIER SCIENCE LTD | - |
dc.title | Improving diameter bounds for distance-regular graphs | - |
dc.type | Article | - |
dc.identifier.wosid | 000234338500008 | - |
dc.identifier.scopusid | 2-s2.0-27744578596 | - |
dc.type.rims | ART | - |
dc.citation.volume | 27 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 79 | - |
dc.citation.endingpage | 89 | - |
dc.citation.publicationname | EUROPEAN JOURNAL OF COMBINATORICS | - |
dc.identifier.doi | 10.1016/j.ejc.2004.07.004 | - |
dc.contributor.localauthor | Koolen J.H. | - |
dc.contributor.nonIdAuthor | Bang S. | - |
dc.contributor.nonIdAuthor | Hiraki A. | - |
dc.type.journalArticle | Article | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.