{"version":"1.0","type":"link","title":"Conference graph - Newikis","description":"In the mathematical area of graph theory, a conference graph is a strongly regular graph with parameters v, k = (v − 1)/2, λ = (v − 5)/4, and μ = (v − 1)/4. It is the graph associated with a symmetric conference matrix, and consequently its order v must be 1 (modulo 4) and a sum of two squares.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/f/f5/Paley_graph_9.svg/1280px-Paley_graph_9.svg.png","thumbnail_width":1280,"thumbnail_height":1253}