Ontify

⌘S

Complete Graph

Complete Digraph

Simple undirected graph in which every pair of distinct vertices is connected by a unique edge.

Wikipedia logo

Wikipedia | Complete Graph

Statements about Complete Graph

Image

Has Characteristic

Vertex Connectivity
Unnamed
:bug: P2534
Edge-Connectivity
Unnamed
:bug: P2534

Studied By

Graph Theory

Opposite Of

Edgeless Graph
Criterion Used
:
Complement Graph

Instance Of

Hereditary Graph Class

Subclass Of

26 items
Undirected Graph
Connected Graph
Cluster Graph
Block Graph
Balanced Complete Multipartite Graph
Threshold Graph
Hamming Graph
Kneser Graph
Traceable Graph
Hamilton-Connected Graph
Symmetric Graph
Strongly Regular Graph
Uniquely Colorable Graph
Integral Graph
Geodetic Graph
Circulant Graph
Gridline Graph
Dense Graph
Turán Graph
Core
Sierpiński Graph
Polytopal Graph
Rook's Graph
Queen's Graph
Johnson Graph
Reason for Deprecated Rank
:
Not All Instances of the Item Are Instances of the Value Class
Unnamed
:bug: P12208
Unnamed
:bug: P12208
Moore Graph
Reason for Deprecated Rank
:
Not All Instances of the Item Are Instances of the Value Class
Unnamed
:bug: P12208
Unnamed
:bug: P12208
Powered byWikidataWikidata

External Pages About Complete Graph

Encyclopædia Britannica Online ID

Encyclopædia Britannica Online