Complete graph
id:
complete-graph-215-3181608
title:
Complete graph
text:
In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges. Graph theory itself is typically dated as beginning with Leonhard Euler's 1736 work on the Seven Bridges of Königsberg. However, drawings of complete graphs, with their vertices placed on the points of a regular polygon
brand slug:
wiki
category slug:
encyclopedia
description:
Graph in which every two vertices are adjacent
original url:
https://en.wikipedia.org/wiki/Complete_graph
date created:
2002-09-15T15:43:54Z
date modified:
2024-09-12T22:01:02Z
main entity:
{"identifier":"Q45715","url":"https://www.wikidata.org/entity/Q45715"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/9/9e/Complete_graph_K7.svg","width":10552,"height":10352}
fields total:
13
integrity:
16