
Accession Number : ADA185375
Title : Eigenvectors of DistanceRegular Graphs,
Corporate Author : CLARKSON UNIV POTSDAM NY DEPT OF MATHEMATICS AND COMPUTER SCIENCE
Personal Author(s) : Powers, David L
PDF Url : ADA185375
Report Date : Jan 1987
Pagination or Media Count : 26
Abstract : The objective of this work is to find properties of a distanceregular graph G that are expressed in the eigenvectors of its adjacency matrix. The approach is to consider the rows of a matrix of orthogonal eigencolumns as (coordinates of) points in euclidean space, each one corresponding to a vertex of G. For the second eigenvalue, the symmetry group of the points is isomorphic to the automorphism group of G. Adjacency of vertices is related to linear dependence, linear independence and proximity of points. Relative position of points studied by way of the polytope that is their convex hull. Several families of examples are included.
Descriptors : *MATRICES(MATHEMATICS), EIGENVECTORS, SYMMETRY, GRAPHS, ORTHOGONALITY, GROUPS(MATHEMATICS)
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE