Timeline for Sum of degree differences for simple graphs
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 16, 2020 at 9:33 | history | bounty ended | CommunityBot | ||
| Mar 10, 2020 at 1:58 | history | edited | Aaron Meyerowitz | CC BY-SA 4.0 |
added 110 characters in body
|
| Mar 9, 2020 at 21:10 | history | bounty ended | CommunityBot | ||
| Mar 2, 2020 at 8:37 | comment | added | user153000 | Luckily, I have not. | |
| Mar 1, 2020 at 23:49 | comment | added | Brendan McKay | @StanTuwim That's interesting. Do you find examples that beat Aaron's records? | |
| Mar 1, 2020 at 23:20 | comment | added | user153000 | I don't think that last remark - changing $01$ with $10$ - is true. I have been checking best binary sequences with fixed number of ones and the maximisers are not always $111...000$ or $000...111$. | |
| Mar 1, 2020 at 23:04 | comment | added | Brendan McKay | This conjecture is correct up to 13 vertices. If the focus on threshold graphs is solid, using the representation of a threshold graph as a binary string (0 for add an isolated vertex, 1 for add a new vertex joined to everything so far) might be the way to go. I think that the effect of changing 01 to 10 in the string is simple. But I stopped working on it so feel free ;). | |
| Mar 1, 2020 at 22:55 | history | edited | Aaron Meyerowitz | CC BY-SA 4.0 |
added 370 characters in body
|
| Mar 1, 2020 at 18:01 | comment | added | user153000 | I agree, in my opinion this should be a maximizer. But it must somehow depend on power $3$. For $1$ instead of $3$ we get so called "total irregularity index" and maximizer turns out to be different... | |
| Mar 1, 2020 at 1:40 | history | answered | Aaron Meyerowitz | CC BY-SA 4.0 |