Let H(n; q, n(1), n(2)) be a graph with n vertices containing a cycle C(q) and two hanging paths P(n1) and P(n2) attached at the same vertex of the cycle. In this paper, we prove that except for the A-cospectral graphs H(12; 6, 1,5) and H(12: 8. 2. 2), no two non-isomorphic graphs of the form H(n; q, n(1), n(2)) are A-cospectral. It is proved that all graphs H(n; q. n(1), n(2)) are determined by their L-spectra. And all graphs H(n; q, n(1), n(2)) are proved to be determined by their Q-spectra, except for graphs H(2a + 4; a + 3, a/2, a/2 + 1) with a being a positive even number and H(2b: b, b/2, b/2) with b >= 4 being an even number. Moreover, the Q-cospectral graphs with these two exceptions are given. (C) 2011 Elsevier By. All rights reser...
Graphs with the same spectrum are called cospectral. A graph is determined by its spectrum if every ...
In this paper some new methods of constructing infinite families of cospeetral graphs are presented....
AbstractLet A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. ...
AbstractLet H(n;q,n1,n2) be a graph with n vertices containing a cycle Cq and two hanging paths Pn1 ...
The \textit{Kite graph}, denoted by $Kite_{p,q}$ is obtained by appending a complete graph $K_{p}$ ...
Let W(n;q,m1,m2) be the unicyclic graph with n vertices obtained by attaching two paths of lengths m...
This thesis studies two subjects. One is the spectral characterization problem, the other is the spe...
Let G be a graph with n vertices, let A(G) be an adjacency matrix of G and let PA(G,λ) be the charac...
AbstractThe lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex...
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...
The Laplacian spectrum of a graph consists of the eigenvalues (together with multiplicities) of the...
AbstractLet ϕ(G,λ) be the characteristic polynomial of a graph G. Two graphs G and H are cospectral,...
At some time, in the childhood of spectral graph theory, it was conjectured that non-isomorphic gra...
AbstractWe investigate a certain condition for isomorphism between circulant graphs (known as the Ád...
Graphs with the same spectrum are called cospectral. A graph is determined by its spectrum if every ...
In this paper some new methods of constructing infinite families of cospeetral graphs are presented....
AbstractLet A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. ...
AbstractLet H(n;q,n1,n2) be a graph with n vertices containing a cycle Cq and two hanging paths Pn1 ...
The \textit{Kite graph}, denoted by $Kite_{p,q}$ is obtained by appending a complete graph $K_{p}$ ...
Let W(n;q,m1,m2) be the unicyclic graph with n vertices obtained by attaching two paths of lengths m...
This thesis studies two subjects. One is the spectral characterization problem, the other is the spe...
Let G be a graph with n vertices, let A(G) be an adjacency matrix of G and let PA(G,λ) be the charac...
AbstractThe lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex...
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...
The Laplacian spectrum of a graph consists of the eigenvalues (together with multiplicities) of the...
AbstractLet ϕ(G,λ) be the characteristic polynomial of a graph G. Two graphs G and H are cospectral,...
At some time, in the childhood of spectral graph theory, it was conjectured that non-isomorphic gra...
AbstractWe investigate a certain condition for isomorphism between circulant graphs (known as the Ád...
Graphs with the same spectrum are called cospectral. A graph is determined by its spectrum if every ...
In this paper some new methods of constructing infinite families of cospeetral graphs are presented....
AbstractLet A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. ...