Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Hello,

I am interested in upper bounding the second largest eigenvalue of the adjacency matrix of a graph $T$ with the following property: 1. $T$ contains self loops. 2. $T$ contains multiple edges (of, alternatively, is a weighted graph). 3. $T$ has a structure of a perfect binary tree (with self loops in every vertex).

The eigenvalue bounds that arise from edge expansion and vertex expansion are too weak for the bound I am trying to prove. How would you suggest dealing with weighted binary trees?

Thank you.

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.