English

A note on the positive semidefinitness of $A_\alpha (G)$

Combinatorics 2016-11-08 v1

Abstract

Let GG be a graph with adjacency matrix A(G)A(G) and let D(G)D(G) be the diagonal matrix of the degrees of GG. For every real α[0,1]\alpha\in\left[ 0,1\right] , write Aα(G)A_{\alpha}\left( G\right) for the matrix Aα(G)=αD(G)+(1α)A(G). A_{\alpha}\left( G\right) =\alpha D\left( G\right) +(1-\alpha)A\left( G\right) . Let α0(G)\alpha_{0}\left( G\right) be the smallest α\alpha for which Aα(G)A_{\alpha}(G) is positive semidefinite. It is known that α0(G)1/2\alpha_{0}\left( G\right) \leq1/2. The main results of this paper are: (1) if GG is dd-regular then α0=λmin(A(G))dλmin(A(G)), \alpha_{0}=\frac{-\lambda_{\min}(A(G))}{d-\lambda_{\min}(A(G))}, where λmin(A(G))\lambda_{\min}(A(G)) is the smallest eigenvalue of A(G)A(G); (2) GG contains a bipartite component if and only if α0(G)=1/2\alpha_{0}\left( G\right) =1/2; (3) if GG is rr-colorable, then α0(G)1/r\alpha_{0}\left( G\right) \geq1/r.

Keywords

Cite

@article{arxiv.1611.01818,
  title  = {A note on the positive semidefinitness of $A_\alpha (G)$},
  author = {Vladimir Nikiforov and Oscar Rojo},
  journal= {arXiv preprint arXiv:1611.01818},
  year   = {2016}
}

Comments

7 pages