AbstractA graph G is said to be determined by its spectrum if any graph having the same spectrum as G is isomorphic to G. A T-shape is a tree with exactly one of its vertices having maximal degree 3. In this paper, we show that all T-shape trees are determined by their spectra, except for a few well-defined cases
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
AbstractA ∞-graph B(r,s) is a graph consisting of two cycles Cr+1 and Cs+1 with just a vertex in com...
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
AbstractA graph G is said to be determined by its spectrum if any graph having the same spectrum as ...
AbstractA T-shape is a tree with exactly one of its vertices having maximal degree 3. It is proved i...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
A T-shape tree is a tree with exactly one vertex of maximum degree 3. The line graphs of the T-shape...
AbstractIn this paper, we show that if G is a starlike tree, then it is determined by its Laplacian ...
A graph G is said to be determined by its spectrum if any graph having the same spectrum as G is iso...
summary:A graph is determined by its signless Laplacian spectrum if no other non-isomorphic graph ha...
The spectral radius of a graph is the largest eigenvalue of the adjacency matrix of the graph. Let $...
AbstractLet A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. ...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
Spectral graph theory studies the relation between structural properties of a graph and the eigenval...
AbstractThe path spectrum of a graph is the set of lengths of all maximal paths in the graph. A set ...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
AbstractA ∞-graph B(r,s) is a graph consisting of two cycles Cr+1 and Cs+1 with just a vertex in com...
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
AbstractA graph G is said to be determined by its spectrum if any graph having the same spectrum as ...
AbstractA T-shape is a tree with exactly one of its vertices having maximal degree 3. It is proved i...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
A T-shape tree is a tree with exactly one vertex of maximum degree 3. The line graphs of the T-shape...
AbstractIn this paper, we show that if G is a starlike tree, then it is determined by its Laplacian ...
A graph G is said to be determined by its spectrum if any graph having the same spectrum as G is iso...
summary:A graph is determined by its signless Laplacian spectrum if no other non-isomorphic graph ha...
The spectral radius of a graph is the largest eigenvalue of the adjacency matrix of the graph. Let $...
AbstractLet A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. ...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
Spectral graph theory studies the relation between structural properties of a graph and the eigenval...
AbstractThe path spectrum of a graph is the set of lengths of all maximal paths in the graph. A set ...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
AbstractA ∞-graph B(r,s) is a graph consisting of two cycles Cr+1 and Cs+1 with just a vertex in com...
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
DOI
Add to ORKG