/explore
|
You are here 
|
yufeizhao.com | ||
| | | | |
11011110.github.io
Another new preprint of mine recently appeared: "Bandwidth vs BFS width in matrix reordering, graph reconstruction, and graph drawing", arXiv:2505.10789, wit... |
|
| | | | | ||
| | | | |
www.jeremykun.com
For fixed integers $ r > 0$, and odd $ g$, a Moore graph is an $ r$-regular graph of girth $ g$ which has the minimum number of vertices $ n$ among all such graphs with the same regularity and girth. (Recall, A the girth of a graph is the length of its shortest cycle, and it's regular if all its vertices have the same degree) Problem (Hoffman-Singleton): Find a useful constraint on the relationship between $ n$ and $ r$ for Moore graphs of girth $ 5$ and degree $ r$. |
|
| | | | | ||
| | | | |
nhigham.com
The Cayley-Hamilton Theorem says that a square matrix $LATEX A$ satisfies its characteristic equation, that is $latex p(A) = 0$ where $latex p(t) = \det(tI-A)$ is the characteristic polynomial. This statement is not simply the substitution ``$latex p(A) = \det(A - A) = 0$'', which is not valid since $latex t$ must remain a scalar... |
|
| | | | | ||
| | | | |
www.trailspotting.com
hiking, railtrails, new hampshire, california, rail trail, outdoors |
|
| | | |||
