Timeline for Is there an algorithm to generate graph edges given amount of vertices and edges per node? [closed]
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 5, 2017 at 15:22 | history | closed |
user6976 Alexey Ustinov Henry.L Chris Godsil Stefan Kohl♦ |
Not suitable for this site | |
| Jul 4, 2017 at 23:56 | review | Close votes | |||
| Jul 5, 2017 at 15:22 | |||||
| Jun 30, 2017 at 16:39 | review | Low quality posts | |||
| Jun 30, 2017 at 17:01 | |||||
| Jun 29, 2017 at 20:09 | vote | accept | DaKnOb | ||
| Jun 29, 2017 at 15:04 | review | Close votes | |||
| Jun 29, 2017 at 18:54 | |||||
| Jun 29, 2017 at 14:50 | comment | added | Brendan McKay | Use a circulant graph: en.wikipedia.org/wiki/Circulant_graph which works for every $\ell,n$ such that $0\le\ell\le n-1$ and $\ell n$ is even. If $\ell n$ is odd, no graph exists. | |
| Jun 29, 2017 at 10:58 | answer | added | Dirk | timeline score: 4 | |
| Jun 29, 2017 at 10:36 | comment | added | DaKnOb |
So far I've figured a way to make this work with a given l, but n must be restricted to (multiples of) 2^l. Thanks a lot of the help. Let's wait and see.
|
|
| Jun 29, 2017 at 10:30 | comment | added | Dirk | Possible: Yes, this is a finite problem. However, I don't know of an algorithm to do it, so you either have to wait for someone else to come up with one or design one yourself. | |
| Jun 29, 2017 at 10:21 | comment | added | DaKnOb | Is it then possible to generate a graph with such properties? Just any graph. Thanks! | |
| Jun 29, 2017 at 10:20 | comment | added | Dirk | Such a graph is not unique, not even up to isomorphism. Thus, it would be hard to find an algorithm to generate "the graph". Take for example two triangles and a circle on six points: In both graphs, you have six points and every point has degree two. | |
| Jun 29, 2017 at 10:07 | history | edited | DaKnOb | CC BY-SA 3.0 |
edited title
|
| Jun 29, 2017 at 9:59 | review | First posts | |||
| Jun 29, 2017 at 10:04 | |||||
| Jun 29, 2017 at 9:56 | history | asked | DaKnOb | CC BY-SA 3.0 |