ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Graphs and combinatorics 3 (1987), S. 95-109 
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We prove the following result. LetΓ be a finite distance-regular graph. Letc i ,a i ,b i be the intersection numbers ofΓ. IfΓ is not an ordinaryn-gon, then the number of (c i ,a i ,b i ) such thatc i =b i is bounded by a certain function of the valencyk, say 10k2 k .
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...