Explore >> Select a destination
|
You are here 
|
yetanothermathprogrammingconsultant.blogspot.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$. | |
| | | | |
hadrienj.github.io
|
|
| | | | | This post will introduce you to special kind of matrices: the identity matrix and the inverse matrix. We will use Python/Numpy as a tool to get a better intu... | |
| | | | |
nulliq.dev
|
|
| | | | | In search of a better dot product | |
| | | | |
blog.demofox.org
|
|
| | | This article explains how these four things fit together and shows some examples of what they are used for. Derivatives Derivatives are the most fundamental concept in calculus. If you have a function, a derivative tells you how much that function changes at each point. If we start with the function $latex y=x^2-6x+13$, we can... | ||
