Graph (discrete mathematics)

In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some sense "related".

Uses your system voice; voice and rate in settings.

Snapshot

≈ 7 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some sense "related". The objects are represented by abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line).

Typically, a graph is depicted in diagrammatic form as a set of dots or circles for the vertices, joined by lines or curves for the edges. 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 an edge from a person A to a person B means that A owes money to B, then this graph is directed, because owing money is not necessarily reciprocated. Graphs are the basic subject studied by graph theory.

The word "graph" was first used in this sense by J. J. Sylvester in 1878 due to a direct relation between mathematics and chemical structure (what he called a chemico-graphical image).

Graph

A graph (sometimes called an undirected graph to distinguish it from a directed graph, or a simple graph to distinguish it from a multigraph) is a pair , where is a set whose elements are called vertices (singular: vertex), and is a set of unordered pairs \{v_1, v_2\} of vertices, whose elements are called edges (sometimes links or lines). An empty graph is a graph that has an empty set of vertices (and thus an empty set of edges).

The order of a graph is its number of vertices, usually denoted by . The size of a graph is its number of edges, typically denoted by . However, in some contexts, such as for expressing the computational complexity of algorithms, the term size is used for the quantity (otherwise, a non-empty graph could have size 0).

The degree or valency of a vertex is the number of edges that are incident to it; for graphs with loops, a loop is counted twice. The vertices and of an edge are called the edge's endpoints. The edge is said to join and and to be incident on them.

A vertex may belong to no edge, in which case it is not joined to any other vertex and is called isolated. When an edge \{u,v\} exists, the vertices and are called adjacent. A multigraph is a generalization that allows multiple edges to have the same pair of endpoints.

In some texts, multigraphs are simply called graphs. Sometimes, graphs are allowed to contain loops, which are edges that join a vertex to itself. To allow loops, the pairs of vertices in must be allowed to have the same node twice.

Such generalized graphs are called graphs with loops or simply graphs when it is clear from the context that loops are allowed. Generally, the vertex set is taken to be finite (which implies that the edge set is also finite).

Sometimes infinite graphs are considered, but they are usually viewed as a special kind of binary relation, because most results on finite graphs either do not extend to the infinite case or need a rather different proof. In a graph of order , the maximum degree of each vertex is (or if loops are allowed, because a loop contributes 2 to the degree), and the maximum number of edges is (or if loops are allowed).

The edges of a graph define a symmetric relation on the vertices, called the adjacency relation. Specifically, two vertices and are adjacent if is an edge. A graph is fully determined by its adjacency matrix , which is an square matrix, with specifying the number of connections from vertex to vertex .

For a simple graph, is either 0, indicating disconnection, or 1, indicating connection; moreover because an edge in a simple graph cannot start and end at the same vertex. Graphs with self-loops will be characterized by some or all being equal to a positive integer, and multigraphs (with multiple edges between vertices) will be characterized by some or all being equal to a positive integer.

Undirected graphs will have a symmetric adjacency matrix (meaning ). 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 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.

The diagram is a schematic representation of the graph with vertices V = \{1, 2, 3, 4, 5, 6\} and edges E = \{\{1, 2\}, \{1, 5\}, \{2, 3\}, \{2, 5\}, \{3, 4\}, \{4, 5\}, \{4, 6\}\}. In computer science, directed graphs are used to represent knowledge (e.g., conceptual graph), finite-state machines, and many other discrete structures.

A binary relation R on a set X defines a directed graph. An element x of X is a direct predecessor of an element y of X if and only if xRy. A directed graph can model information networks such as Twitter, with one user following another.

Particularly regular examples of directed graphs are given by the Cayley graphs of finitely-generated groups, as well as Schreier coset graphs In category theory, every small category has an underlying directed multigraph whose vertices are the objects of the category, and whose edges are the arrows of the category. In the language of category theory, one says that there is a forgetful functor from the category of small categories to the category of quivers.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1378429332 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

5 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.