Let p(G)p(G) and q(G)q(G) be the number of pendant vertices and quasi-pendant vertices of a simple undirected graph G, respectively. Let m_L±(G)(1) be the multiplicity of 1 as eigenvalue of a matrix which can be either the Laplacian or the signless Laplacian of a graph G. A result due to I. Faria states that mL±(G)(1) is bounded below by p(G)−q(G). Let r(G) be the number of internal vertices of G. If r(G)=q(G), following a unified approach we prove that mL±(G)(1)=p(G)−q(G). If r(G)>q(G) then we determine the equality mL±(G)(1)=p(G)−q(G)+mN±(1), where mN±(1) denotes the multiplicity of 1 as eigenvalue of a matrix N±. This matrix is obtained from either the Laplacian or signless Laplacian matrix of the subgraph induced by the internal vertic...
In this note we discuss interlacing inequalities relating the eigenvalues of a partitioned Hermitian...
AbstractLet G=(V,E) be a simple graph on vertex set V={v1,v2,…,vn}. Further let di be the degree of ...
Let G be a simple graph with n vertices. The characteristic polynomial det(xI − A) of a (0,1)-adjace...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
Let G be a finite simple graph with vertex set V(G) = {v1, v2, v3, …, vn} and edge set E(G). The adj...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
Let G be a graph of order n with signless Laplacian eigenvalues q(1),...,q(n) and Laplacian eigenval...
Let G be a simple graph of order n. The matrix ℒG=DG−AG is called the Laplacian matrix of G, where D...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
Abstract. We extend our previous survey of properties of spectra of signless Laplacians of graphs. S...
If μm and dm denote, respectively, the m-th largest Laplacian eigenvalue and the m-th largest vertex...
summary:Let $G$ be a connected graph of order $n$ and $U$ a unicyclic graph with the same order. We ...
Suppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest eigenvalue...
In this note we discuss interlacing inequalities relating the eigenvalues of a partitioned Hermitian...
AbstractLet G=(V,E) be a simple graph on vertex set V={v1,v2,…,vn}. Further let di be the degree of ...
Let G be a simple graph with n vertices. The characteristic polynomial det(xI − A) of a (0,1)-adjace...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
Let G be a finite simple graph with vertex set V(G) = {v1, v2, v3, …, vn} and edge set E(G). The adj...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
Let G be a graph of order n with signless Laplacian eigenvalues q(1),...,q(n) and Laplacian eigenval...
Let G be a simple graph of order n. The matrix ℒG=DG−AG is called the Laplacian matrix of G, where D...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
Abstract. We extend our previous survey of properties of spectra of signless Laplacians of graphs. S...
If μm and dm denote, respectively, the m-th largest Laplacian eigenvalue and the m-th largest vertex...
summary:Let $G$ be a connected graph of order $n$ and $U$ a unicyclic graph with the same order. We ...
Suppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest eigenvalue...
In this note we discuss interlacing inequalities relating the eigenvalues of a partitioned Hermitian...
AbstractLet G=(V,E) be a simple graph on vertex set V={v1,v2,…,vn}. Further let di be the degree of ...
Let G be a simple graph with n vertices. The characteristic polynomial det(xI − A) of a (0,1)-adjace...