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

Direct link
A bound for the number of columns l(c,a,b) in the intersection array of a distance-regular graph
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics. BIOINFORMATIK.
2003 (English)In: European Journal of Combinatorics, Vol. 24, 785-795 p.Article in journal (Refereed) Published
Place, publisher, year, edition, pages
2003. Vol. 24, 785-795 p.
URN: urn:nbn:se:uu:diva-48162OAI: oai:DiVA.org:uu-48162DiVA: diva2:76068
Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-13

Open Access in DiVA

No full text

By organisation
Department of Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 137 hits
ReferencesLink to record
Permanent link

Direct link