Graph Theory Basics

Front

What is a complete graph?

Back

A complete graph is a type of graph in which every pair of distinct vertices is connected by a unique edge.

Front

What are vertices in a graph?

Back

Vertices are the fundamental units of a graph, represented as points or nodes where edges meet.

Front

What are edges in a graph?

Back

Edges are the lines or curves that connect pairs of vertices in a graph.

Front

What is an edge set?

Back

The edge set of a graph is the collection of all edges in the graph.

Front

What is an adjacent vertex?

Back

Adjacent vertices are two vertices that are connected by an edge.

Front

What is a path in graph theory?

Back

A path is a sequence of edges that connects a sequence of vertices without revisiting any vertex.

Front

What is a cycle in graph theory?

Back

A cycle is a path that starts and ends at the same vertex, with no other vertices repeated.

Front

What is a circuit in graph theory?

Back

A circuit is a closed path in a graph where all edges are distinct.

Front

What is a simple graph?

Back

A simple graph is a graph that does not have multiple edges between the same pair of vertices and does not have loops.

Front

What is a directed graph?

Back

A directed graph (or digraph) is a graph where the edges have a direction, indicated by arrows.