A note on the positive semidefinitness of Aα(G)A_α(G)

preprint2016arXivOpen access

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]α\in\left[ 0,1\right] , write Aα(G)A_α\left( G\right) for the matrix Aα(G)=αD(G)+(1−α)A(G). A_α\left( G\right) =αD\left( G\right) +(1-α)A\left( G\right) . Let α0(G)α_{0}\left( G\right) be the smallest αα for which Aα(G)A_α(G) is positive semidefinite. It is known that α0(G)≤1/2α_{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)), α_{0}=\frac{-λ_{\min}(A(G))}{d-λ_{\min}(A(G))}, where λmin⁡(A(G))λ_{\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α_{0}\left( G\right) =1/2; (3) if GG is rr-colorable, then α0(G)≥1/rα_{0}\left( G\right) \geq1/r.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.