On certain regular graphs of girth 5
Let f(v,5) be the number of vertices of a (v,5)-cage (v≥3). We give an upper bound for f(v,5) which is considerably better than the previously known upper bounds. In particular, when v=7, it coincides with the well-known Hoffman- Singleton graph.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1984-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171284000806 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|