Timeline for An upper bound for the largest Laplacian eigenvalue of a graph in terms of its diameter
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 10, 2018 at 8:04 | vote | accept | Mostafa - Free Palestine | ||
| Nov 28, 2018 at 8:36 | history | edited | RaphaelB4 | CC BY-SA 4.0 |
added 603 characters in body
|
| Nov 23, 2018 at 19:37 | comment | added | Mostafa - Free Palestine | Could you please give the detailed proof for the estimate on the eigenvalues of $L'$? I don't understand the usage of max- min principle here. | |
| Nov 23, 2018 at 18:43 | vote | accept | Mostafa - Free Palestine | ||
| Nov 27, 2018 at 16:09 | |||||
| Nov 23, 2018 at 16:02 | history | edited | RaphaelB4 | CC BY-SA 4.0 |
added 783 characters in body
|
| Nov 22, 2018 at 20:56 | comment | added | fedja | Just apply the Schur test with the test vector $[|A|,(|B|+1)\sqrt{|A|},(|A|+|C|)\sqrt{|B|}, (|B|+1)\sqrt{|C|}, |C|]^T$ to check the desired bound. | |
| Nov 22, 2018 at 12:10 | history | edited | RaphaelB4 | CC BY-SA 4.0 |
edited body
|
| Nov 22, 2018 at 10:18 | history | answered | RaphaelB4 | CC BY-SA 4.0 |