Explore >> Select a destination
|
You are here 
|
stephenmalina.com | ||
| | | | |
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$. | |
| | | | |
mattbaker.blog
|
|
| | | | | Test your intuition: is the following true or false? Assertion 1: If $latex A$ is a square matrix over a commutative ring $latex R$, the rows of $latex A$ are linearly independent over $latex R$ if and only if the columns of $latex A$ are linearly independent over $latex R$. (All rings in this post... | |
| | | | |
chessapig.github.io
|
|
| | | | | ||
| | | | |
clutterreport.wordpress.com
|
|
| | | attempting to clean up my living and workspace | ||
