{"version":"1.0","type":"link","title":"Cluster graph - Newikis","description":"In graph theory, a branch of mathematics, a cluster graph is a graph formed from the disjoint union of complete graphs. Equivalently, a graph is a cluster graph if and only if it has no three-vertex induced path; for this reason, the cluster graphs are also called P3-free graphs. They are the…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/3/38/Equivalentie.svg/1280px-Equivalentie.svg.png","thumbnail_width":1280,"thumbnail_height":1280}