{"version":"1.0","type":"link","title":"Highly irregular graph - Newikis","description":"In graph theory, a highly irregular graph is a graph in which, for every vertex, all neighbors of that vertex have distinct degrees.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/1/1e/Highly_irregular_graph.svg/1280px-Highly_irregular_graph.svg.png","thumbnail_width":1280,"thumbnail_height":1241}