Eigenvalues of Laplacian are non-negative

  • Context: MHB 
  • Thread starter Thread starter tarnat
  • Start date Start date
  • Tags Tags
    Eigenvalues Laplacian
Click For Summary
SUMMARY

The proof that the eigenvalues of the Laplacian matrix L are non-negative is established through the equation x.Lx=0.5 sum(Aij(xi-xj)^2), where A represents the adjacency matrix of a graph. This relationship demonstrates that the quadratic form associated with the Laplacian is always non-negative, leading to the conclusion that all eigenvalues are non-zero for indices 1 PREREQUISITES

  • Understanding of graph theory concepts, particularly adjacency matrices.
  • Familiarity with Laplacian matrices and their properties.
  • Knowledge of eigenvalues and eigenvectors in linear algebra.
  • Basic proficiency in mathematical proofs and inequalities.
NEXT STEPS
  • Study the properties of Laplacian matrices in graph theory.
  • Learn about the spectral graph theory and its applications.
  • Explore the relationship between graph connectivity and eigenvalues.
  • Investigate the implications of non-negative eigenvalues in various mathematical contexts.
USEFUL FOR

Mathematicians, students of linear algebra, and researchers in graph theory who are interested in the properties of Laplacian matrices and their eigenvalues.

tarnat
Messages
1
Reaction score
0
Hi, I need to learn the following proof and I'm having trouble getting my head round it. Any help would be appreciated.

Show that if vector x in R^n with components x=(x1,x2,...,xn), then
x.Lx=0.5 sum(Aij(xi-xj)^2)
where A is the graphs adjacency matrix, L is laplacian.
Then use this result to prove that the eigen values of L are non-zero for all 1<j<n.

Thanks.
 
Physics news on Phys.org
I have deleted the duplicate of this thread posted in the Discrete Mathematics subforum.

We ask that a question be posted only once and in the appropriate subforum. This eliminates the possibility of duplication of effort on the part of our helpers, whose time is valuable. :D
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
6K
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
2
Views
2K
  • · Replies 16 ·
Replies
16
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K