{"version":"1.0","type":"link","title":"Degree diameter problem - Newikis","description":"In graph theory, the degree–diameter problem asks for the maximum possible number of vertices in a finite simple undirected graph of maximum degree at most and diameter at most . A breadth-first search gives a general upper bound known as the Moore bound.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/8/8e/Degree_diameter.svg/1280px-Degree_diameter.svg.png","thumbnail_width":1280,"thumbnail_height":650}