Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

For an adjacency matrix $A$ that represent a graph $G=\langle V,E\rangle$, I need to show that the maxcut is bounded by:

$$ \mathrm{maxcut} \leq \frac{1}{2}|E| - \frac{|V| \lambda_{\min}(A)}{4}, $$

where $\lambda_{\min}(A)$ is the minimal eigenvalue of $A$.

I tried to use the fact that $$\lambda_{\min}(A) = \min(\frac{X^TAX}{X^TX}) $$

and to add that to the fact that $ X^TAX = 2 \sum_{ i,j \in E}^{a} \left( x_{i}x_{j} \right) $ for all vector $ x \in R^{|v|}$, but it doesn't work.

Any ideas?

share|improve this question
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.