MetaGlossary.com: Clique

Definitions for "Clique" Add To Word List

Keywords: Subgraph, Undirected, Graph, Subset, Artymiuk

Related Terms: Polygon , Graph, Hypergraph, Dag, Bipartite, Connected, Diagonal, Hexagonal, Quadrant, Segment, Tetragonal, Frequency Polygon, Edge , Frontal Plane, Subgraph, Degree, Digraph, Directed Graph, Loop , Multigraph, Planar, Weighted Graph, Quadrants, Independent Set, Transverse Plane, Graph Theory, Ordered Pair, Sagittal Plane, Planar Graph, Undirected Graph, Adjacency Matrix, Bipartite Graph, Matching, Topological Sort, Directed Acyclic Graph, Dependency Graph, Plane Of Symmetry, Bilaterally Symmetrical, Complete Graph, Coronal Plane, Inscribed Polygon, Altitude Of A Triangle, Median Of A Triangle, Conceptual Graph, Graph G, Hamiltonian Cycle, Hamiltonian Path, Minimum Spanning Tree, Signed Graph

Submit a better definition with this meaning

a region of a graph where each vertex is connected to the others

http://pagebox.net/graph.html

Helpful?

a subgraph of a graph in which every node is connected to every other node and that is not contained in any larger subgraph with this property (Artymiuk et al

http://dis.shef.ac.uk/ruth/litrevb.html

Helpful?

a subgraph that is complete

http://people.bethelks.edu/krf/csc321/20051026.html

Helpful?

a subset of vertices where all vertices are adjacent

http://csus.cs.mcgill.ca/wiki/COMP-250_%28Blanchette%2C_Fall_05%29_Course_S...

Helpful?

a subset of vertices which induce a complete graph

http://forums.wolfram.com/mathgroup/archive/1998/Sep/msg00282.html

Helpful?

a subset V' of vertices in an undirected graph G such that every pair of distinct vertices in V' is joined by an edge in G (i

http://www.augustana.ca/~mohrj/courses/2004.winter/csc310/lecture_notes/NPc...

Helpful?

(n.): A subset S of the vertices of a graph such that all pairs of vertices in S are adjacent.

http://www.math.harvard.edu/~elkies/FS23j.03/glossary_graph.html

Helpful?

subgraph that is a complete graph.

http://www-math.cudenver.edu/~wcherowi/courses/m4408/glossary.html

Helpful?

In graph theory, a clique in an undirected graph G is a set of vertices V such that for every two vertices in V, there exists an edge connecting the two. This is equivalent to saying that the subgraph induced by V is a complete graph. The size of a clique is the number of vertices it contains.

http://en.wikipedia.org/wiki/Clique_(graph_theory)

Helpful?

Privacy Statement | Terms of Use