Article ID Journal Published Year Pages File Type
4654697 European Journal of Combinatorics 2007 9 Pages PDF
Abstract

Relations between Laplacian eigenvectors and eigenvalues and the existence of almost equitable partitions (which are generalizations of equitable partitions) are presented. Furthermore, on the basis of some properties of the adjacency eigenvectors of a graph, a necessary and sufficient condition for the graph to be primitive strongly regular is introduced.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, , ,