AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we survey the cases for which the answer is known. Not only the adjacency matrix, but also other types of matrices, such as the Laplacian matrix, are considered
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
AbstractIt is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian ...
Given a graph G we can form a matrix A_G indexed by the vertices of G and which encodes the edges of...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
AbstractIn [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebr...
bra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are deter...
In [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebra Appl. ...
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
AbstractWe consider the class of graphs each of whose components is either a path or a cycle. We cla...
AbstractIt is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian ...
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
Abstract: Let Gl be the graph obtained from Kl by adhering the root of isomorphic trees T to every v...
AbstractA graph is said to be determined by the adjacency spectrum (DS for short) if there is no oth...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
AbstractIt is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian ...
Given a graph G we can form a matrix A_G indexed by the vertices of G and which encodes the edges of...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
AbstractIn [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebr...
bra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are deter...
In [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebra Appl. ...
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
AbstractWe consider the class of graphs each of whose components is either a path or a cycle. We cla...
AbstractIt is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian ...
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
Abstract: Let Gl be the graph obtained from Kl by adhering the root of isomorphic trees T to every v...
AbstractA graph is said to be determined by the adjacency spectrum (DS for short) if there is no oth...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
AbstractIt is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian ...
Given a graph G we can form a matrix A_G indexed by the vertices of G and which encodes the edges of...
DOI
Add to ORKG