Timeline for Optimization over Spectral Laplacian in cycles and trees
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 3, 2013 at 20:20 | comment | added | Royeh | @Casteels: yes, that's what I want to do. I am trying to start from a simple cycle and with knowing symmetric properties expand my work to trees and some other class of graphs. | |
| Jun 1, 2013 at 15:12 | comment | added | Casteels | So, for example, for fixed $n$, you want to characterize the trees on $n$ vertices whose sum of first $k$ eigenvalues is maximum? | |
| Jun 1, 2013 at 8:15 | history | edited | Royeh | CC BY-SA 3.0 |
deleted 4 characters in body
|
| May 31, 2013 at 21:53 | comment | added | Royeh | @Casteels: You're right. I edit my question. | |
| May 31, 2013 at 21:51 | history | edited | Royeh | CC BY-SA 3.0 |
added 155 characters in body; added 7 characters in body
|
| May 31, 2013 at 19:25 | comment | added | Casteels | I don't understand your question. The sum of the eigenvalues of the Laplacian of a graph with m edges is always 2m. So what exactly are you trying to optimize? | |
| May 31, 2013 at 12:11 | history | asked | Royeh | CC BY-SA 3.0 |