Symmetric squares of graphs

Journal of Combinatorial Theory. Series B

Volumn 97, Issue 1, 2007, Pages 74-90

  Audenaert, Koenraad ^a   Godsil, Chris ^b   Royle, Gordon ^c   Rudolph, Terry ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

Graph isomorphism; Spectrum; Walks

Indexed keywords

EID: 33751414544     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2006.04.002     Document Type: Article

References (6)

1. Rudolph T. Constructing physically intuitive graph invariants. eprint: (2002). http://arxiv.org/abs/quant-ph/0206068
2. Shiau S.-Y., Joynt R., and Coppersmith S.N. Physically motivated dynamical algorithms for the graph isomorphism problem. eprint: (2003). http://arxiv.org/abs/quant-ph/0312170
3. Godsil C.D. Algebraic Combinatorics (1993), Chapman & Hall, London
4. Horn R.A., and Johnson C.R. Matrix Analysis (1985), Cambridge Univ. Press, Cambridge
5. Bhatia R. Matrix Analysis (1997), Springer-Verlag, New York
6. Choi M.D. Completely positive linear maps on complex matrices. Linear Algebra Appl. 10 (1975) 285-290