{"version":"1.0","type":"link","title":"Strongly regular graph - Newikis","description":"In graph theory, a strongly regular graph (SRG) is a regular graph G = (V, E) with v vertices and degree k such that for some given integers","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/0/05/Paley13.svg/1280px-Paley13.svg.png","thumbnail_width":1280,"thumbnail_height":1280}