On the Faria's inequality for the Laplacian and signless Laplacian spectra: a unified approach
Data(s) |
24/02/2015
2015
|
---|---|
Resumo |
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 vertices which are non-quasi-pendant vertices. Furthermore, conditions for 1 to be an eigenvalue of a principal submatrix are deduced and applied to some families of graphs. |
Identificador |
0024-3795 |
Idioma(s) |
eng |
Publicador |
Elsevier |
Relação |
FCT/CIDMA - UID/MAT/04106/2013 FONDECYT Regular 1130135 http://dx.doi.org/10.1016/j.laa.2015.01.026 |
Direitos |
restrictedAccess |
Palavras-Chave | #Spectral graph theory #Laplacian spectrum of a graph #Signless Laplacian spectrum of a graph |
Tipo |
article |