Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G + A_G$ in which $D_G$ and $A_G$ denote the degree matrix and the adjacency matrix of $G$, respectively. The graph $G$ is said to be determined by its signless Laplacian spectrum (DQS, for short), if any graph having the same signless Laplacian spectrum as $G$ is isomorphic to $G$. We show that $G\sqcup rK_2$ is determined by its signless Laplacian spectra under certain conditions, where $r$ and $K_2$ denote a natural number and the complete graph on two vertices, respectively. Applying these results, some DQS graphs with independent edges are obtained
AbstractLet AG and DG be respectively the adjacency matrix and the degree matrix of a graph G. The s...
We extend our previous survey of properties of spectra of signless Laplacians of graphs. Some new bo...
AbstractIn this paper we give two results concerning the signless Laplacian spectra of simple graphs...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
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...
AbstractLet G be an r-regular graph of order n. We prove that the cone over G is determined by its s...
Let G be a simple graph with n vertices. The characteristic polynomial det(xI − A) of a (0,1)-adjace...
AbstractA ∞-graph is a graph consisting of two cycles with just a vertex in common. We first look fo...
AbstractLet Knm denote the graph obtained by attaching m pendent edges to a vertex of complete graph...
summary:Given a graph $G$, if there is no nonisomorphic graph $H$ such that $G$ and $H$ have the sam...
AbstractConsider the Laplacian and signless Laplacian spectrum of a graph G of order n, with k pairw...
Let G be a finite simple graph with vertex set V(G) = {v1, v2, v3, …, vn} and edge set E(G). The adj...
AbstractWe survey properties of spectra of signless Laplacians of graphs and discuss possibilities f...
AbstractLet AG and DG be respectively the adjacency matrix and the degree matrix of a graph G. The s...
We extend our previous survey of properties of spectra of signless Laplacians of graphs. Some new bo...
AbstractIn this paper we give two results concerning the signless Laplacian spectra of simple graphs...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
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...
AbstractLet G be an r-regular graph of order n. We prove that the cone over G is determined by its s...
Let G be a simple graph with n vertices. The characteristic polynomial det(xI − A) of a (0,1)-adjace...
AbstractA ∞-graph is a graph consisting of two cycles with just a vertex in common. We first look fo...
AbstractLet Knm denote the graph obtained by attaching m pendent edges to a vertex of complete graph...
summary:Given a graph $G$, if there is no nonisomorphic graph $H$ such that $G$ and $H$ have the sam...
AbstractConsider the Laplacian and signless Laplacian spectrum of a graph G of order n, with k pairw...
Let G be a finite simple graph with vertex set V(G) = {v1, v2, v3, …, vn} and edge set E(G). The adj...
AbstractWe survey properties of spectra of signless Laplacians of graphs and discuss possibilities f...
AbstractLet AG and DG be respectively the adjacency matrix and the degree matrix of a graph G. The s...
We extend our previous survey of properties of spectra of signless Laplacians of graphs. Some new bo...
AbstractIn this paper we give two results concerning the signless Laplacian spectra of simple graphs...