Clique (graph theory)
id:
clique-graph-theory-196-5434911
title:
Clique (graph theory)
text:
In the mathematical area of graph theory, a clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. That is, a clique of a graph G is an induced subgraph of G that is complete. Cliques are one of the basic concepts of graph theory and are used in many other mathematical problems and constructions on graphs. Cliques have also been studied in computer science: the task of finding whether there is a clique of a given size in a graph is
brand slug:
wiki
category slug:
encyclopedia
description:
Adjacent subset of an undirected graph
original url:
https://en.wikipedia.org/wiki/Clique_(graph_theory)
date created:
date modified:
2023-12-28T08:26:32Z
main entity:
{"identifier":"Q761631","url":"https://www.wikidata.org/entity/Q761631"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/d0/VR_complex.svg","width":585,"height":468}
fields total:
13
integrity:
15