AbstractIn this paper, we show that if G is a starlike tree, then it is determined by its Laplacian spectrum. Moreover we prove some facts about trees with the same adjacency spectrum as a starlike tree
For the normalized Laplacian matrix it is possible for graphs with differing number of edges to have...
We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for devel...
We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for devel...
AbstractIn this paper, we show that if G is a starlike tree, then it is determined by its Laplacian ...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
AbstractIt is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian ...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
AbstractA tree is called double starlike if it has exactly two vertices of degree greater than 2. We...
AbstractA tree which has exactly one vertex of degree greater than two is said to be starlike. In sp...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
AbstractThe lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex...
AbstractLet A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. ...
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
AbstractA T-shape is a tree with exactly one of its vertices having maximal degree 3. It is proved i...
AbstractLet Knm denote the graph obtained by attaching m pendent edges to a vertex of complete graph...
For the normalized Laplacian matrix it is possible for graphs with differing number of edges to have...
We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for devel...
We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for devel...
AbstractIn this paper, we show that if G is a starlike tree, then it is determined by its Laplacian ...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
AbstractIt is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian ...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
AbstractA tree is called double starlike if it has exactly two vertices of degree greater than 2. We...
AbstractA tree which has exactly one vertex of degree greater than two is said to be starlike. In sp...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
AbstractThe lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex...
AbstractLet A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. ...
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
AbstractA T-shape is a tree with exactly one of its vertices having maximal degree 3. It is proved i...
AbstractLet Knm denote the graph obtained by attaching m pendent edges to a vertex of complete graph...
For the normalized Laplacian matrix it is possible for graphs with differing number of edges to have...
We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for devel...
We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for devel...
DOI
Add to ORKG