DOIAbstract
AbstractA tree is said to be starlike if exactly one of its vertices has degree greater than two. We show that no two non-isomorphic starlike trees are cospectral
AbstractA tree is said to be starlike if exactly one of its vertices has degree greater than two. We show that no two non-isomorphic starlike trees are cospectral
The Gy´arf´as-Sumner conjecture asserts that if H is a tree then every graph with bounded clique num...
Graphs with the same spectrum are called cospectral. A graph is determined by its spectrum if every ...
AbstractLet ϕ(G,λ) be the characteristic polynomial of a graph G. Two graphs G and H are cospectral,...
AbstractA tree which has exactly one vertex of degree greater than two is said to be starlike. In sp...
We prove that no tree contains a set of three vertices which are pairwise strongly cospectral. This ...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
AbstractIn this paper, we show that if G is a starlike tree, then it is determined by its Laplacian ...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
AbstractLet A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. ...
We show that a number of graph invariants are, even combined, insufficient to distinguish between noni...
For the normalized Laplacian matrix it is possible for graphs with differing number of edges to have...
We construct graphs that are cospectral but nonisomorphic with Kneser graphs K(n, k), when n = 3k − ...
Trees with two nonadjacent vertices of degree larger than two are not integral. This settles a quest...
AbstractA skew star is a tree with exactly three vertices of degree one being at distance 1, 2, 3 fr...
The Gy´arf´as-Sumner conjecture asserts that if H is a tree then every graph with bounded clique num...
Graphs with the same spectrum are called cospectral. A graph is determined by its spectrum if every ...
AbstractLet ϕ(G,λ) be the characteristic polynomial of a graph G. Two graphs G and H are cospectral,...
AbstractA tree which has exactly one vertex of degree greater than two is said to be starlike. In sp...
We prove that no tree contains a set of three vertices which are pairwise strongly cospectral. This ...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
AbstractIn this paper, we show that if G is a starlike tree, then it is determined by its Laplacian ...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
AbstractLet A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. ...
We show that a number of graph invariants are, even combined, insufficient to distinguish between noni...
For the normalized Laplacian matrix it is possible for graphs with differing number of edges to have...
We construct graphs that are cospectral but nonisomorphic with Kneser graphs K(n, k), when n = 3k − ...
Trees with two nonadjacent vertices of degree larger than two are not integral. This settles a quest...
AbstractA skew star is a tree with exactly three vertices of degree one being at distance 1, 2, 3 fr...
The Gy´arf´as-Sumner conjecture asserts that if H is a tree then every graph with bounded clique num...
Graphs with the same spectrum are called cospectral. A graph is determined by its spectrum if every ...
AbstractLet ϕ(G,λ) be the characteristic polynomial of a graph G. Two graphs G and H are cospectral,...
Add to ORKG