Sign patterns of graph laplacian eigenvectors

Activity: Talk or presentationScience to professionals/public


The Laplacian matrix holds a lot of structural information about a given graph. In this talk we give a short introduction in the properties of this matrix and its eigenvectors. In particular we investigate their sign patterns and the number of so called nodal domains which are maximal components where the vector does not change sign.
Period27 Apr 2012
Event titleIstanbul Discrete Mathematics Meetings
Event typeUnkonwn