Timeline for graphs with maximal number of paths of given length
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 10, 2012 at 20:43 | comment | added | user20638 | yes, I know that. But I don't see how I can use it. | |
| Apr 10, 2012 at 20:40 | comment | added | Jernej | Just a random note. Let $A$ be the adjacency matrix of your graph. The number of walks of length $k$ between vertices $v_i,v_j$ is given by the $(v_i,v_j)$ entry of $A^k$. Maybe this can help you somehow. | |
| Apr 10, 2012 at 18:58 | comment | added | user20638 | yes, sorry I forgot to mention. The number of vertices is also given. But if it helps, consider it can be as large as you wish and you don't need to connect them all. And by the way, I just noticed my mistake: I need the graphs which maximise the number of walks, not paths ! Sorry again | |
| Apr 10, 2012 at 16:21 | comment | added | Felix Goldberg | Is the number of vertices also given? | |
| Apr 10, 2012 at 14:43 | history | asked | user20638 | CC BY-SA 3.0 |