{"version":"1.0","type":"link","title":"Dense graph - Newikis","description":"In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges (where every pair of vertices is connected by one edge). The opposite, a graph with only a few edges, is a sparse graph. The distinction of what constitutes a dense or sparse graph is…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/5/54/Not_sparse_family.svg/1280px-Not_sparse_family.svg.png","thumbnail_width":1280,"thumbnail_height":1125}