Jump to content

Intersection array

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Cbigorgne (talk | contribs) at 15:02, 20 November 2011. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In the mathematical field of graph theory, given a distance-regular graph G of diameter d, by definition there are integers bi and ci such that given any two vertices x and y in G at distance i, y has bi neighbours at distance i + 1 from x and ci neighbours at distance i − 1 from x. The sequence {b0, ..., bd−1;c1, ..., cd} is called the intersection array of G.

  • Weisstein, Eric W. "Intersection Array". MathWorld.
Stub icon

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Intersection_array&oldid=461603449"