Timeline for Relationship between spectral gaps of adjacency and Laplacian matrices of graphs
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 27, 2021 at 10:54 | vote | accept | Vilas Winstein | ||
| Jul 27, 2021 at 10:53 | answer | added | Vilas Winstein | timeline score: 3 | |
| Jul 12, 2021 at 15:00 | comment | added | Vilas Winstein | Another update: there is actually no correlation (in general) with (max degree - min degree). Let G be the graph on three vertices, where two of them have self-loops of weight n and the other one has degree 0. Then (max degree - min degree) = n, but the spectral gaps of A and L are both 0. | |
| Jul 11, 2021 at 7:49 | comment | added | Vilas Winstein | Update: the relationship which I said "seems to be roughly linear" is actually not linear in general. The sequence of star graphs has (min degree - max degree) ~ n, but the difference between the spectral gaps is ~ sqrt(n). | |
| Jul 8, 2021 at 14:42 | review | First posts | |||
| Jul 8, 2021 at 14:45 | |||||
| Jul 8, 2021 at 14:40 | history | edited | Vilas Winstein |
edited tags
|
|
| Jul 8, 2021 at 14:35 | history | asked | Vilas Winstein | CC BY-SA 4.0 |