uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Faculty of Science and Technology, Biology, The Linnaeus Centre for Bioinformatics.
2004 (English)In: Journal of Algebraic Combinatorics, Vol. 19, no 2, 205-217 p.Article in journal (Refereed) Published
Abstract [en]

In this paper we prove that there are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10.

Place, publisher, year, edition, pages
2004. Vol. 19, no 2, 205-217 p.
Keyword [en]
distance-regular graphs, bannai-ito conjecture, fixed valency
Identifiers
URN: urn:nbn:se:uu:diva-71814OAI: oai:DiVA.org:uu-71814DiVA: diva2:99725
Available from: 2005-05-12 Created: 2005-05-12 Last updated: 2011-01-12

Open Access in DiVA

No full text

By organisation
The Linnaeus Centre for Bioinformatics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 288 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf