Keywords

#complete_graph

Complete graph

Graph in which every two vertices are adjacent

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.

Fri 13th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Complete graph Complete bipartite graph Graph (discrete mathematics) Graph coloring Graph isomorphism problem Planar graph Glossary of graph theory Clique (graph theory) Graph theory Graph homomorphism
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.