In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related". The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called an arc or line).^{[1]} Typically, a graph is depicted in diagrammatic form as a set of dots for the vertices, joined by lines or curves for the edges. Graphs are one of the objects of study in discrete mathematics.
The edges may be directed or undirected. For example, if the vertices represent people at a party, and there is an edge between two people if they shake hands, then this graph is undirected because any person A can shake hands with a person B only if B also shakes hands with A. In contrast, if any edge from a person A to a person B corresponds to A's admiring B, then this graph is directed, because admiration is not necessarily reciprocated. The former type of graph is called an undirected graph and the edges are called undirected edges while the latter type of graph is called a directed graph and the edges are called directed edges.
Graphs are the basic subject studied by graph theory. The word "graph" was first used in this sense by J. J. Sylvester in 1878.^{[2]}^{[3]}
Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures.
In one very common sense of the term,^{[4]} a graph is an ordered pair comprising a set V of vertices, nodes or points together with a set E of edges, arcs or lines, which are 2-element subsets of V (i.e., an edge is associated with two vertices, and the association takes the form of the unordered pair of the vertices). To avoid ambiguity, this type of graph may be described precisely as undirected and simple.
Other senses of graph stem from different conceptions of the edge set. In one more general conception,^{[5]}E is a set together with a relation of incidence that associates with each edge two vertices. In another generalized notion, E is a multiset of unordered pairs of (not necessarily distinct) vertices. Many authors call these types of object multigraphs or pseudographs.
All of these variants and others are described more fully below.
The vertices belonging to an edge are called the ends or end vertices of the edge. A vertex may exist in a graph and not belong to an edge.
V and E are usually taken to be finite, and many of the well-known results are not true (or are rather different) for infinite graphs because many of the arguments fail in the infinite case. Moreover, V is often assumed to be non-empty, but E is allowed to be the empty set. The order of a graph is |V|, its number of vertices. The size of a graph is |E|, its number of edges. The degree or valency of a vertex is the number of edges that connect to it, where an edge that connects to the vertex at both ends (a loop) is counted twice.
For an edge }, graph theorists usually use the somewhat shorter notation xy.
The edges E of an undirected graph G induce a symmetric binary relation ~ on V that is called the adjacency relation of G. Specifically, for each edge }, the vertices x and y are said to be adjacent to one another, which is denoted .
As stated above, in different contexts it may be useful to refine the term graph with different degrees of generality. Whenever it is necessary to draw a strict distinction, the following terms are used. Most commonly, in modern texts in graph theory, unless stated otherwise, graph means "undirected simple finite graph" (see the definitions below).
An undirected graph is a graph in which edges have no orientation. The edge is identical to the edge . That is, they are not ordered pairs, but unordered pairs--i.e., sets of two vertices } (or 2-multisets in the case of loops). The maximum number of edges in an undirected graph without a loop is .
A directed graph or digraph is a graph in which edges have orientations. It is written as an ordered pair (sometimes ) with
An arrow is considered to be directed from x to y; y is called the head and x is called the tail of the arrow; y is said to be a direct successor of x and x is said to be a direct predecessor of y. If a path leads from x to y, then y is said to be a successor of x and reachable from x, and x is said to be a predecessor of y. The arrow is called the inverted arrow of .
A directed graph G is called symmetric if, for every arrow in G, the corresponding inverted arrow also belongs to G. A symmetric loopless directed graph is equivalent to a simple undirected graph , where the pairs of inverse arrows in A correspond one-to-one with the edges in E; thus the number of edges in G? is , that is half the number of arrows in G.
An oriented graph is a directed graph in which at most one of and may be arrows of the graph. That is, it is a directed graph that can be formed as an orientation of an undirected graph. However, some authors use "oriented graph" to mean the same as "directed graph".
A mixed graph is a graph in which some edges may be directed and some may be undirected. It is written as an ordered triple with V, E, and A defined as above. Directed and undirected graphs are special cases.
Multiple edges are two or more edges that connect the same two vertices. A loop is an edge (directed or undirected) that connects a vertex to itself; it may be permitted or not, according to the application. In this context, an edge with two different ends is called a link.
A multigraph, as opposed to a simple graph, is an undirected graph in which multiple edges (and sometimes loops) are allowed.
Where graphs are defined so as to disallow both multiple edges and loops, a multigraph is often defined to mean a graph which can have both multiple edges and loops,^{[6]} although many use the term pseudograph for this meaning.^{[7]} Where graphs are defined so as to allow both multiple edges and loops, a multigraph is often defined to mean a graph without loops.^{[8]}
A simple graph is an undirected graph in which both multiple edges and loops are disallowed. In a simple graph the edges form a set (rather than a multiset) and each edge is an unordered pair of distinct vertices. Thus, we can define a simple graph to be a set V of vertices together with a set E of edges, which are 2-element subsets of V.
In a simple graph with n vertices, the degree of every vertex is at most .
A quiver or multidigraph is a directed multigraph. A quiver may have directed loops in it. Thus, a quiver is a set V of vertices, a set E of edges, and two functions , . The map s assigns to each edge its source (or tail), while the map t assigns to each edge its target (or head).
A weighted graph is a graph in which a number (the weight) is assigned to each edge.^{[9]} Such weights might represent for example costs, lengths or capacities, depending on the problem at hand. Some authors call such a graph a network.^{[10]}^{[11]}Weighted correlation networks can be defined by soft-thresholding the pairwise correlations among variables (e.g. gene measurements). Such graphs arise in many contexts, for example in shortest path problems such as the traveling salesman problem.
In certain situations it can be helpful to allow edges with only one end, called half-edges, or no ends, called loose edges; see the articles Signed graphs and Biased graphs.
A regular graph is a graph in which each vertex has the same number of neighbours, i.e., every vertex has the same degree. A regular graph with vertices of degree k is called a k-regular graph or regular graph of degree k.
A complete graph is a graph in which each pair of vertices is joined by an edge. A complete graph contains all possible edges.
A finite graph is a graph in which the vertex set and the edge set are finite sets. Otherwise, it is called an infinite graph.
Most commonly in graph theory it is implied that the graphs discussed are finite. If the graphs are infinite, that is usually specifically stated.
In an undirected graph, an unordered pair of vertices } is called connected if a path leads from x to y. Otherwise, the unordered pair is called disconnected.
A connected graph is an undirected graph in which every unordered pair of vertices in the graph is connected. Otherwise, it is called a disconnected graph.
In a directed graph, an ordered pair of vertices is called strongly connected if a directed path leads from x to y. Otherwise, the ordered pair is called weakly connected if an undirected path leads from x to y after replacing all of its directed edges with undirected edges. Otherwise, the ordered pair is called disconnected.
A strongly connected graph is a directed graph in which every ordered pair of vertices in the graph is strongly connected. Otherwise, it is called a weakly connected graph if every ordered pair of vertices in the graph is weakly connected. Otherwise it is called a disconnected graph.
A k-vertex-connected graph or k-edge-connected graph is a graph in which no set of vertices (respectively, edges) exists that, when removed, disconnects the graph. A k-vertex-connected graph is often called simply a k-connected graph.
A bipartite graph is a graph in which the vertex set can be partitioned into two sets, W and X, so that no two vertices in W share a common edge and no two vertices in X share a common edge. Alternatively, it is a graph with a chromatic number of 2.
In a complete bipartite graph, the vertex set is the union of two disjoint sets, W and X, so that every vertex in W is adjacent to every vertex in X but there are no edges within W or X.
A path graph or linear graph of order is a graph in which the vertices can be listed in an order v_{1}, v_{2}, ..., v_{n} such that the edges are the } where i = 1, 2, ..., n - 1. Path graphs can be characterized as connected graphs in which the degree of all but two vertices is 2 and the degree of the two remaining vertices is 1. If a path graph occurs as a subgraph of another graph, it is a path in that graph.
A planar graph is a graph whose vertices and edges can be drawn in a plane such that no two of the edges intersect.
A cycle graph or circular graph of order is a graph in which the vertices can be listed in an order v_{1}, v_{2}, ..., v_{n} such that the edges are the } where i = 1, 2, ..., n - 1, plus the edge }. Cycle graphs can be characterized as connected graphs in which the degree of all vertices is 2. If a cycle graph occurs as a subgraph of another graph, it is a cycle or circuit in that graph.
A tree is a connected graph with no cycles.
A forest is a graph with no cycles, i.e. the disjoint union of one or more trees.
More advanced kinds of graphs are:
Two edges of a graph are called adjacent if they share a common vertex. Two arrows of a directed graph are called consecutive if the head of the first one is the tail of the second one. Similarly, two vertices are called adjacent if they share a common edge (consecutive if the first one is the tail and the second one is the head of an arrow), in which case the common edge is said to join the two vertices. An edge and a vertex on that edge are called incident.
The graph with only one vertex and no edges is called the trivial graph. A graph with only vertices and no edges is known as an edgeless graph. The graph with no vertices and no edges is sometimes called the null graph or empty graph, but the terminology is not consistent and not all mathematicians allow this object.
Normally, the vertices of a graph, by their nature as elements of a set, are distinguishable. This kind of graph may be called vertex-labeled. However, for many questions it is better to treat vertices as indistinguishable. (Of course, the vertices may be still distinguishable by the properties of the graph itself, e.g., by the numbers of incident edges.) The same remarks apply to edges, so graphs with labeled edges are called edge-labeled. Graphs with labels attached to edges or vertices are more generally designated as labeled. Consequently, graphs in which vertices are indistinguishable and edges are indistinguishable are called unlabeled. (Note that in the literature, the term labeled may apply to other kinds of labeling, besides that which serves only to distinguish different vertices or edges.)
The category of all graphs is the slice category Set ? D where D: Set -> Set is the functor taking a set s to s × s.
There are several operations that produce new graphs from initial ones, which might be classified into the following categories:
In a hypergraph, an edge can join more than two vertices.
An undirected graph can be seen as a simplicial complex consisting of 1-simplices (the edges) and 0-simplices (the vertices). As such, complexes are generalizations of graphs since they allow for higher-dimensional simplices.
Every graph gives rise to a matroid.
In model theory, a graph is just a structure. But in that case, there is no limitation on the number of edges: it can be any cardinal number, see continuous graph.
In computational biology, power graph analysis introduces power graphs as an alternative representation of undirected graphs.
In geographic information systems, geometric networks are closely modeled after graphs, and borrow many concepts from graph theory to perform spatial analysis on road networks or utility grids.
A graph is an object consisting of two sets called its vertex set and its edge set.
A weighted graph is a graph in which a number w(e), called its weight, is assigned to each edge e.
Manage research, learning and skills at defaultLogic. Create an account using LinkedIn or facebook to manage and organize your Digital Marketing and Technology knowledge. defaultLogic works like a shopping cart for information -- helping you to save, discuss and share.
Visit defaultLogic's partner sites below: