Published May 25, 2022
| Version v1
Dataset
Open
Ramanujan graphs with degree 3, 4, 5, 6, or 7
Authors/Creators
- 1. Department of Mathematical Sciences, University of Delaware
- 2. Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences
- 3. Department of Computing and Mathematics, University of West Georgia
Contributors
Data manager:
- 1. Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences
Description
This data set collects all
- Ramanujan graphs
- 3-regular with at most 20 vertices
- 4-regular with at most 16 vertices
- 5-, 6-, 7-regular with at most 14 vertices
- Bipartite Ramanujan graphs
- 4-regular with at most 22 vertices
- 5-, 6-, 7-regular with at most 20 vertices
- Vertex-transitive Ramanujan graphs
- 4-, 5-, 6-, 7-regular with at most 47 vertices
All files are in Graph6 data format. If a file for a given order does not exist, there are no graphs with that order and the respective property.
Notes
Files
K3RamanujanGraphs.zip
Files
(294.7 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:01c27fc930c2840fde088fad5f4f8371
|
2.7 MB | Preview Download |
|
md5:3ba6040d1e23b432ab86af724144cd17
|
15.1 MB | Preview Download |
|
md5:b47b5bfedcfaebd9c074214a4e8b3562
|
39.4 MB | Preview Download |
|
md5:216c3db1b0c4bf3f664397955e1cd33b
|
27.5 kB | Preview Download |
|
md5:699dc3da265378c6fb88e231b39ad6b1
|
1.6 MB | Preview Download |
|
md5:92596300bd7d15a6fcd62710d41c13a0
|
15.5 MB | Preview Download |
|
md5:dc9e4a2b188b457d4cb22d69e3bf52b5
|
74.9 kB | Preview Download |
|
md5:bdf62fad6649fe820809a4bac3c2914c
|
365.0 kB | Preview Download |
|
md5:fb2dbf7bf7d909063d18f5a6897abbf3
|
109.2 MB | Preview Download |
|
md5:8e12a50d59829c809aeae60d832cc0aa
|
276.8 kB | Preview Download |
|
md5:17f711db9864dd8dae946b368bdbbc1e
|
5.4 kB | Preview Download |
|
md5:9efac2599cbd6631c46dbd2d739d758c
|
109.8 MB | Preview Download |
|
md5:692cc36eb511402fd496f364b46a083c
|
541.1 kB | Preview Download |
Additional details
Funding
- U.S. National Science Foundation
- Analytic and Geometric Inverse Problems and Related Topics 1815922
- FWF Austrian Science Fund
- Realizations of Rigid Graphs P 31888