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
AbstractA graph is said to be determined by the adjacency and Laplacian spectrum (or to be a DS grap...
AbstractIn [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebr...
AbstractA graph G is said to be determined by its spectrum if any graph having the same spectrum as ...
AbstractIn this paper, some sufficient conditions are given on a graph G, under which it is proved t...
AbstractLet ϕ(G,λ) be the characteristic polynomial of a graph G. Two graphs G and H are cospectral,...
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
AbstractA ∞-graph B(r,s) is a graph consisting of two cycles Cr+1 and Cs+1 with just a vertex in com...
AbstractA graph is said to be determined by its adjacency spectrum (DS for short) if there is no oth...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
AbstractA ∞-graph is a graph consisting of two cycles with just a vertex in common. We first look fo...
Spectral graph theory studies the relation between structural properties of a graph and the eigenval...
AbstractThe lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex...
We construct infinite families of graphs that are determined by their generalized spectrum. This con...
Let G be a graph with n vertices, let A(G) be an adjacency matrix of G and let PA(G,λ) be the charac...
AbstractIt is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian ...
AbstractA graph is said to be determined by the adjacency and Laplacian spectrum (or to be a DS grap...
AbstractIn [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebr...
AbstractA graph G is said to be determined by its spectrum if any graph having the same spectrum as ...
AbstractIn this paper, some sufficient conditions are given on a graph G, under which it is proved t...
AbstractLet ϕ(G,λ) be the characteristic polynomial of a graph G. Two graphs G and H are cospectral,...
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
AbstractA ∞-graph B(r,s) is a graph consisting of two cycles Cr+1 and Cs+1 with just a vertex in com...
AbstractA graph is said to be determined by its adjacency spectrum (DS for short) if there is no oth...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
AbstractA ∞-graph is a graph consisting of two cycles with just a vertex in common. We first look fo...
Spectral graph theory studies the relation between structural properties of a graph and the eigenval...
AbstractThe lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex...
We construct infinite families of graphs that are determined by their generalized spectrum. This con...
Let G be a graph with n vertices, let A(G) be an adjacency matrix of G and let PA(G,λ) be the charac...
AbstractIt is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian ...
AbstractA graph is said to be determined by the adjacency and Laplacian spectrum (or to be a DS grap...
AbstractIn [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebr...
AbstractA graph G is said to be determined by its spectrum if any graph having the same spectrum as ...