AbstractWe consider the class of graphs whose each component is either a proper subgraph of some Smith graphs, or belongs to a precized subset of Smith graphs. We classify the graphs from the considered class into those which are determined, or not determined, by Laplacian, or signless Laplacian spectrum
AbstractWe study the Laplacian spectrum of (α, ω)-graphs which play an important role in the theory ...
AbstractIn this paper we study the Laplacian spectra, the Laplacian polynomials, and the number of s...
In this paper, we investigate the relation between the Q-spectrum and the structure of G in terms of...
AbstractWe consider the class of graphs each of whose components is either a path or a cycle. We cla...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
AbstractWe survey properties of spectra of signless Laplacians of graphs and discuss possibilities f...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
AbstractLet A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. ...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
The Laplacian spectrum of a graph consists of the eigenvalues (together with multiplicities) of the...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
Let G be a simple graph with n vertices. The characteristic polynomial det(xI − A) of a (0,1)-adjace...
A graph G is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with...
Abstract. A spectral graph theory is a theory in which graphs are studied by means of eigenvalues of...
AbstractIn this paper, we show that if G is a starlike tree, then it is determined by its Laplacian ...
AbstractWe study the Laplacian spectrum of (α, ω)-graphs which play an important role in the theory ...
AbstractIn this paper we study the Laplacian spectra, the Laplacian polynomials, and the number of s...
In this paper, we investigate the relation between the Q-spectrum and the structure of G in terms of...
AbstractWe consider the class of graphs each of whose components is either a path or a cycle. We cla...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
AbstractWe survey properties of spectra of signless Laplacians of graphs and discuss possibilities f...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
AbstractLet A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. ...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
The Laplacian spectrum of a graph consists of the eigenvalues (together with multiplicities) of the...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
Let G be a simple graph with n vertices. The characteristic polynomial det(xI − A) of a (0,1)-adjace...
A graph G is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with...
Abstract. A spectral graph theory is a theory in which graphs are studied by means of eigenvalues of...
AbstractIn this paper, we show that if G is a starlike tree, then it is determined by its Laplacian ...
AbstractWe study the Laplacian spectrum of (α, ω)-graphs which play an important role in the theory ...
AbstractIn this paper we study the Laplacian spectra, the Laplacian polynomials, and the number of s...
In this paper, we investigate the relation between the Q-spectrum and the structure of G in terms of...
DOI
Add to ORKG