A matrix representation of graphs and its spectrum as a graph invariant
The electronic journal of combinatorics, Tome 13 (2006)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/1060
Classification : 05E30, 05C60, 05C50
Mots-clés : orthogonal matrix, strongly regular graphs
@article{10_37236_1060,
     author = {David Emms and Edwin R. Hancock and Simone Severini and Richard C. Wilson},
     title = {A matrix representation of graphs and its spectrum as a graph invariant},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1060},
     zbl = {1099.05082},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1060/}
}
TY  - JOUR
AU  - David Emms
AU  - Edwin R. Hancock
AU  - Simone Severini
AU  - Richard C. Wilson
TI  - A matrix representation of graphs and its spectrum as a graph invariant
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1060/
DO  - 10.37236/1060
ID  - 10_37236_1060
ER  - 
%0 Journal Article
%A David Emms
%A Edwin R. Hancock
%A Simone Severini
%A Richard C. Wilson
%T A matrix representation of graphs and its spectrum as a graph invariant
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1060/
%R 10.37236/1060
%F 10_37236_1060
David Emms; Edwin R. Hancock; Simone Severini; Richard C. Wilson. A matrix representation of graphs and its spectrum as a graph invariant. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1060

Cité par Sources :