summary:Given a graph $G$, if there is no nonisomorphic graph $H$ such that $G$ and $H$ have the same signless Laplacian spectra, then we say that $G$ is \hbox {$Q$-DS}. In this paper we show that every fan graph $F_n$ is \hbox {$Q$-DS}, where $F_{n}=K_{1}\vee P_{n-1}$ and $n\geq 3$
A rose graph with p petals (or p-rose graph) is a graph obtained by taking p cycles with just a vert...
AbstractLet AG and DG be respectively the adjacency matrix and the degree matrix of a graph G. The s...
AbstractA spectral graph theory is a theory in which graphs are studied by means of eigenvalues of a...
Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G +...
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...
AbstractWe survey properties of spectra of signless Laplacians of graphs and discuss possibilities f...
AbstractThe graph Cn1∇Kk is the product of a circuit Cn1 and a clique Kk. In this paper, we will pro...
AbstractLet AG and DG be respectively the adjacency matrix and the degree matrix of a graph G. The s...
AbstractLet G be an r-regular graph of order n. We prove that the cone over G is determined by its s...
AbstractA ∞-graph is a graph consisting of two cycles with just a vertex in common. We first look fo...
Let G be a simple graph with n vertices. The characteristic polynomial det(xI − A) of a (0,1)-adjace...
AbstractIn this paper we give two results concerning the signless Laplacian spectra of simple graphs...
A rose graph with p petals (or p-rose graph) is a graph obtained by taking p cycles with just a vert...
A rose graph with p petals (or p-rose graph) is a graph obtained by taking p cycles with just a vert...
A rose graph with p petals (or p-rose graph) is a graph obtained by taking p cycles with just a vert...
AbstractLet AG and DG be respectively the adjacency matrix and the degree matrix of a graph G. The s...
AbstractA spectral graph theory is a theory in which graphs are studied by means of eigenvalues of a...
Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G +...
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...
AbstractWe survey properties of spectra of signless Laplacians of graphs and discuss possibilities f...
AbstractThe graph Cn1∇Kk is the product of a circuit Cn1 and a clique Kk. In this paper, we will pro...
AbstractLet AG and DG be respectively the adjacency matrix and the degree matrix of a graph G. The s...
AbstractLet G be an r-regular graph of order n. We prove that the cone over G is determined by its s...
AbstractA ∞-graph is a graph consisting of two cycles with just a vertex in common. We first look fo...
Let G be a simple graph with n vertices. The characteristic polynomial det(xI − A) of a (0,1)-adjace...
AbstractIn this paper we give two results concerning the signless Laplacian spectra of simple graphs...
A rose graph with p petals (or p-rose graph) is a graph obtained by taking p cycles with just a vert...
A rose graph with p petals (or p-rose graph) is a graph obtained by taking p cycles with just a vert...
A rose graph with p petals (or p-rose graph) is a graph obtained by taking p cycles with just a vert...
AbstractLet AG and DG be respectively the adjacency matrix and the degree matrix of a graph G. The s...
AbstractA spectral graph theory is a theory in which graphs are studied by means of eigenvalues of a...