Cluster graph
id:
cluster-graph-265-17957391
title:
Cluster graph
text:
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 complement graphs of the complete multipartite graphs and the 2-leaf powers. The cluster graphs are transitively closed, and every transitively closed undirected graph is a cluster graph. The cluster graphs
brand slug:
wiki
category slug:
encyclopedia
description:
Graph made from disjoint union of complete graphs
original url:
https://en.wikipedia.org/wiki/Cluster_graph
date created:
date modified:
2023-06-25T06:47:10Z
main entity:
{"identifier":"Q24892498","url":"https://www.wikidata.org/entity/Q24892498"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/3/38/Equivalentie.svg","width":360,"height":360}
fields total:
13
integrity:
15