- order of a graph
- The order of a graph G is |V|, the number of vertices in the graph.
- size of a graph
- The size of a graph G is |E|, the number of edges in the graph.
- degree of a vertex
- The degree of a vertex is the number of edges that connect to it. A loop is counted twice.
Types of graphs
- Undirected graph
- An undirected graph or simple graph is a type of graph where each edge is a 2-multiset of two vertices, thus order is not important.
- Directed graph
- A directed graph or digraph is a type of graph where E is a set and each edge is an ordered pair of two vertices, thus order is considered.
- Mixed graph
- A mixed graph is a type of graph that may contain both undirected and directed edges.
- A multigraph is describe as a graph that allows multiple edges, that is, E may not be a set.
- Simple graph
- A simple graph is an undirected graph with no multiple edges (distinct elements in E) and no loops.
- Weighted graph
- A weighted graph is a type of graph where each edge is assigned a number or weight. This is especially useful in problem-solving situations because it may represent things such as costs, flow, distances, lengths, and others.
Community content is available under CC-BY-SA unless otherwise noted.