There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Koolen J.H. | ko |
| dc.contributor.author | Moulton V. | ko |
| dc.date.accessioned | 2013-03-03T14:48:25Z | - |
| dc.date.available | 2013-03-03T14:48:25Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 2004 | - |
| dc.identifier.citation | JOURNAL OF ALGEBRAIC COMBINATORICS, v.19, no.2, pp.205 - 217 | - |
| dc.identifier.issn | 0925-9899 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/79133 | - |
| dc.description.abstract | In this paper we prove that there are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10. | - |
| dc.language | English | - |
| dc.publisher | KLUWER ACADEMIC PUBL | - |
| dc.subject | FIXED VALENCY | - |
| dc.title | There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10 | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000220672600005 | - |
| dc.identifier.scopusid | 2-s2.0-3543105486 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 19 | - |
| dc.citation.issue | 2 | - |
| dc.citation.beginningpage | 205 | - |
| dc.citation.endingpage | 217 | - |
| dc.citation.publicationname | JOURNAL OF ALGEBRAIC COMBINATORICS | - |
| dc.identifier.doi | 10.1023/B:JACO.0000023006.04375.60 | - |
| dc.contributor.nonIdAuthor | Moulton V. | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordAuthor | distance-regular graphs | - |
| dc.subject.keywordAuthor | Bannai-Ito conjecture | - |
| dc.subject.keywordPlus | FIXED VALENCY | - |
- Appears in Collection
- 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 |  |
| ⊙ Cited 7 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.