Improving diameter bounds for distance-regular graphs

Cited 8 time in webofscience Cited 0 time in scopus
  • Hit : 259
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorBang S.ko
dc.contributor.authorHiraki A.ko
dc.contributor.authorKoolen J.H.ko
dc.date.accessioned2013-03-07T00:38:40Z-
dc.date.available2013-03-07T00:38:40Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2006-
dc.identifier.citationEUROPEAN JOURNAL OF COMBINATORICS, v.27, no.1, pp.79 - 89-
dc.identifier.issn0195-6698-
dc.identifier.urihttp://hdl.handle.net/10203/88961-
dc.description.abstractIn 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.languageEnglish-
dc.publisherACADEMIC PRESS LTD ELSEVIER SCIENCE LTD-
dc.titleImproving diameter bounds for distance-regular graphs-
dc.typeArticle-
dc.identifier.wosid000234338500008-
dc.identifier.scopusid2-s2.0-27744578596-
dc.type.rimsART-
dc.citation.volume27-
dc.citation.issue1-
dc.citation.beginningpage79-
dc.citation.endingpage89-
dc.citation.publicationnameEUROPEAN JOURNAL OF COMBINATORICS-
dc.identifier.doi10.1016/j.ejc.2004.07.004-
dc.contributor.localauthorKoolen J.H.-
dc.contributor.nonIdAuthorBang S.-
dc.contributor.nonIdAuthorHiraki A.-
dc.type.journalArticleArticle-
Appears in Collection
RIMS Journal Papers
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 8 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0