With the aid of a computer. we give a regular graph of girth 6 and valency 7, which has 90 vertices and show that this is the unique smallest graph with these properties.
Letf(v,5)be the number of vertices of a(v,5)-cage(v≥3). We give an upper bound forf(v,5)which is considerably better than the previously known upper bounds. In particular, whenv=7, it coincides with the well-known Hoffman- Singleton graph.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.