Compact graphs and equitable partitions

Linear Algebra and Its Applications

Volumn 255, Issue 1-3, 1997, Pages 259-266

  Godsil, C D ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038907455     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(97)83595-1     Document Type: Article

References (10)

1. L. Babai, D. Yu. Grigoryev, and D. M. Mount, Isomorphism of graphs with bounded eigenvalue multiplicity, in Proceedings of the 14th ACM STOC, 1982, pp. 310-324.
2. A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular Graphs, Springer-Verlag, Berlin, 1989.
3. R. A. Brualdi, Some applications of doubly stochastic matrices, Linear Algebra Appl. 107:77-100 (1988).
4. D. G. Cornell and C. C. Gottleib, An efficient algorithm for graph isomorphism, J. Assoc. Comput. Mach. 17:51-64 (1970).
5. C. D. Godsil, Algebraic Combinatorics Chapman and Hall, New York, 1993.
6. C. D. Godsil and B. D. McKay, Feasibility conditions for the existence of walk-regular graphs, Linear Algebra Appl. 30:51-61 (1980).
7. M. A. Naimark and A. I. Štern, Theory of Group Representations, Springer-Verlag, New York, 1982.
8. H. Schreck and G. Tinhofer, A note on certain subpolytopes of the assignment polytope associated with circulant graphs. Linear Algebra Appl. 111:125-134 (1988).
9. G. Tinhofer, Graph isomorphism and theorems of Birkhoff type, Computing 36:285-300 (1986).
10. G. Tinhofer, A note on compact graphs, Discrete Appl. Math. 30:253-264 (1991).