{"version":"1.0","type":"link","title":"Cameron graph - Newikis","description":"The Cameron graph is a strongly regular graph of parameters . This means that it has 231 vertices, 30 edges per vertex, 9 triangles per edges, and 3 two-edge paths between every two non-adjacent vertices.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/9/90/Cameron_graph.svg/1280px-Cameron_graph.svg.png","thumbnail_width":1280,"thumbnail_height":1280}