Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
back to result list
  • 1
    Electronic Resource
    Electronic Resource
    Bounding the diameter of distance-regular graphs (1988)
    Springer
    Combinatorica 8 (1988), S. 333-343 
    Details
    ISSN: 1439-6912
    Keywords: 05 C 99
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract LetG be a connected distance-regular graph with valencyk〉2 and diameterd, but not a complete multipartite graph. Suppose thatθ is an eigenvalue ofG with multiplicitym and thatθ≠±k. We prove that bothd andk are bounded by functions ofm. This implies that, ifm〉1 is given, there are only finitely many connected, co-connected distance-regular graphs with an eigenvalue of multiplicitym.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02189090
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...