A note on the positive semidefiniteness of A_(G)

From MaRDI portal
Publication:512054



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




Cited in
(51)








This page was built for publication: A note on the positive semidefiniteness of \(A_{\alpha}(G)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512054)