AbstractIn this paper, some sufficient conditions are given on a graph G, under which it is proved that G⋃{x} is determined by the generalized spectrum iff G is determined by the generalized spectrum, where G⋃{x} is the graph obtained from the graph G by adding an isolated vertex x
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
Graphs with the same spectrum are called cospectral. A graph is determined by its spectrum if every ...
AbstractThis paper is concerned with the spectral version of the reconstruction conjecture: Whether ...
AbstractIn this paper, some sufficient conditions are given on a graph G, under which it is proved t...
AbstractA graph G is said to be determined by its spectrum (DS for short), if any graph having the s...
AbstractWhat kinds of graphs are determined by their spectra (DS for short) is a difficult problem i...
AbstractIn [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebr...
AbstractA graph is said to be determined by its adjacency spectrum (DS for short) if there is no oth...
AbstractIn Wang and Xu (2006) [15,16] the authors introduced a family of graphs Hn and gave some met...
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 and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
AbstractLet ϕ(G,λ) be the characteristic polynomial of a graph G. Two graphs G and H are cospectral,...
AbstractA graph G is said to be determined by its spectrum if any graph having the same spectrum as ...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
Spectral graph theory studies the relation between structural properties of a graph and the eigenval...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
Graphs with the same spectrum are called cospectral. A graph is determined by its spectrum if every ...
AbstractThis paper is concerned with the spectral version of the reconstruction conjecture: Whether ...
AbstractIn this paper, some sufficient conditions are given on a graph G, under which it is proved t...
AbstractA graph G is said to be determined by its spectrum (DS for short), if any graph having the s...
AbstractWhat kinds of graphs are determined by their spectra (DS for short) is a difficult problem i...
AbstractIn [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebr...
AbstractA graph is said to be determined by its adjacency spectrum (DS for short) if there is no oth...
AbstractIn Wang and Xu (2006) [15,16] the authors introduced a family of graphs Hn and gave some met...
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 and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
AbstractLet ϕ(G,λ) be the characteristic polynomial of a graph G. Two graphs G and H are cospectral,...
AbstractA graph G is said to be determined by its spectrum if any graph having the same spectrum as ...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
Spectral graph theory studies the relation between structural properties of a graph and the eigenval...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
Graphs with the same spectrum are called cospectral. A graph is determined by its spectrum if every ...
AbstractThis paper is concerned with the spectral version of the reconstruction conjecture: Whether ...
DOI
Add to ORKG