A matrix representation of graphs and its spectrum as a graph invariant

Electronic Journal of Combinatorics

Volumn 13, Issue 1 R, 2006, Pages 1-14

  Emms, David ^a   Hancock, Edwin R ^a   Severini, Simone ^a   Wilson, Richard C ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33645654719     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1060     Document Type: Article

References (16)

1. A. Ambainis, Quantum walks and their algorithmic applications, quant-ph/0403120.
2. A. E. Brouwer, Strongly regular graphs, in: The CRC Handbook of Combinatorial Designs (eds.: Colbourn and Dinitz), 667-685, CRC Press, 1996.
3. P. J. Cameron, Strongly regular graphs, www.maths.qmw.ac.uk/pjc/ preprints.
4. A. M. Duval, A directed graph version of strongly regular graphs, J. Combin. Theory Ser. A 47 (1988), no. 1, 71-100.
5. C. Godsil and G. Royle, Algebraic Graph Theory, Graduate Texts in Mathematics, 207, Springer-Verlag, New York, 2001.
6. V. Gudkov and S. Nussinov, Graph equivalence and characterization via a continuous evolution of a physical analog, cond-mat/0209112.
7. F. Harary, Frank and R. Z. Norman, Some properties of line digraphs, Rend. Circ. Mat. Palermo (2) 9 1960, 161-168.
8. G. N. Lin, Guo Ning and F. J. Zhang, Characteristic polynomials of directed line graphs, and a class of directed graphs with the same spectrum (Chinese), Kexue Tongbao (Chinese) 28 (1983), no. 22, 1348-1350.
9. B. McKay, cs.anu.edu.au/~bdm/data/latin.html.
10. V. R. Rosenfeld, Some spectral properties of the arc-graph, Match No. 43 (2001), 41-48.
11. T. Rudolph, Constructing physically intuitive graph invariants, quant-ph/0206068.
12. S. Severini, The underlying digraph of a coined quantum random walk, ERATO Conference in Quantum Information Science, Tokyo, Japan, 2003, quant-ph/0210055.
13. S.-Y. Shiau, R. Robert, and S. N. Coppersmith, Physically-motivated dynamical algorithms for the graph isomorphism problem, quant-ph/0312170.
14. T. Spence, www.maths.gla.ac.uk/es/srgraphs.html.
15. D. A. Spielman, Faster isomorphism testing of strongly regular graphs, Proceedings of the Twenty-eighth Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996), 576-584, ACM, New York, 1996.
16. E. R. van Dam and W. H. Haemers, Which graphs are determined by their spectrum? Special issue on the Combinatorial Matrix Theory Conference (Pohang, 2002), Linear Algebra Appl. 373 (2003), 241-272.