/explore
|
You are here 
|
galowicz.de | ||
| | | | |
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$. |
|
| | | | | ||
| | | | |
leanprover-community.github.io
[AI summary] A technical documentation entry for the Lean mathematical library detailing definitions and operations for semimodules, modules, matrices, linear maps, and bilinear forms |
|
| | | | | ||
| | | | |
www.scijournal.org
This guide will show you how to write a dot product in LaTeX |
|
| | | | | ||
| | | | |
leimao.github.io
Jacobian Matrix, De Novo Chain Rule Expression, Jacobian-Vector Product, Vector-Jacobian Product |
|
| | | |||
