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

From MaRDI portal
Publication:2500953

zbMATH Open1099.05082arXivquant-ph/0505026MaRDI QIDQ2500953FDOQ2500953

Simone Severini, Richard C. Wilson, Edwin R. Hancock, David Emms

Publication date: 30 August 2006

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the first two cases, we compute the spectrum explicitly and show that it is determined by the spectrum of the adjacency matrix of the original graph. We then show by computation that the isomorphism classes of many known families of strongly regular graphs (up to 64 vertices) are characterized by the spectrum of this matrix. We conjecture that this is always the case for strongly regular graphs and we show that the conjecture is not valid for general graphs. We verify that the smallest regular graphs which are not distinguished with our method are on 14 vertices.


Full work available at URL: https://arxiv.org/abs/quant-ph/0505026

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)






Cited In (33)


   Recommendations





This page was built for publication: A matrix representation of graphs and its spectrum as a graph invariant

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500953)