GeezerVisonThe World Wide Web, restored to 800 pixels of glory. | |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites | |
GeezerVison is showing mathworld.wolfram.com — Intersection Array -- from Wolfram MathWorld Intersection Array
The intersection array of
when, for any two vertices A similar type of intersection array can also be defined for a distance-transitive graph.
A distance-regular graph with global parameters See alsoDistance-Regular Graph, Distance-Transitive Graph, Global ParametersExplore with Wolfram|AlphaMore things to try: ReferencesBendito, E.; Carmona, A.; and Encinas, A. M. "Shortest Paths in Distance-Regular Graphs." Europ. J. Combin. 21, 153-166, 2000.Biggs, N. L. Algebraic Graph Theory, 2nd ed. Cambridge, England: Cambridge University Press, 1993.Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. Distance-Regular Graphs. New York: Springer-Verlag, 1989.Godsil, C. and Royle, G. Algebraic Graph Theory. New York: Springer-Verlag, p. 68, 2001.Koolen, J. H.; Yu, K.; Liang, X.; Choi, H.; and Markowsky, G. "Non-Geometric Distance-Regular Graphs of Diameter at Least 3 with Smallest Eigenvalue at LeastReferenced on Wolfram|AlphaIntersection ArrayCite this as:Weisstein, Eric W. "Intersection Array." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/IntersectionArray.html Subject classifications | |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |