Bipartite graphIn the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U {\displaystyle U} and V {\displaystyle V} , that is, every edge connects a vertex in U {\displaystyle U} to one in V {\displaystyle V} . Vertex sets U {\displaystyle U} and V {\displaystyle V} are usually called the parts of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles.
Vertex (graph theory)In discrete mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices).
Directed graphIn mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs.
Incidence structureIn mathematics, an incidence structure is an abstract system consisting of two types of objects and a single relationship between these types of objects. Consider the points and lines of the Euclidean plane as the two types of objects and ignore all the properties of this geometry except for the relation of which points are incident on which lines for all points and lines. What is left is the incidence structure of the Euclidean plane.
Levi graphIn combinatorial mathematics, a Levi graph or incidence graph is a bipartite graph associated with an incidence structure. From a collection of points and lines in an incidence geometry or a projective configuration, we form a graph with one vertex per point, one vertex per line, and an edge for every incidence between a point and a line. They are named for Friedrich Wilhelm Levi, who wrote about them in 1942.
Graph theoryArea of discrete mathematicsA graph with 6 vertices and 7 edgesIn mathematics and computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called arcs, links, or lines).
MathematicsField of knowledgeIlluminated letter P at the beginning of Adelard of Bath's translation of Euclid's Elements, which starts "Punctum est illud cui pars non est" ('A point is that which has no part'). Geometry is shown personified as a woman, following Martianus Capella's De nuptiis Philologiae et Mercurii.Mathematics is a field of knowledge concerned with abstract concepts such as numbers, geometric shapes, sets, functions, and probabilities.
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". 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).
CodomainIn mathematics, a codomain or set of destination of a function is a set into which all of the outputs of the function are constrained to fall. It is the set Y in the notation f : X → Y. The term range is sometimes ambiguously used to refer to either the codomain or the image of a function. A codomain is part of a function f if f is defined as a triple (X, Y, G) where X is called the domain of f, Y its codomain, and G its graph.Social choice theorySocial choice theory is a branch of welfare economics that seeks to extend the theory of rational choice to collective decision-making. Social choice studies the behavior of different mathematical procedures (social welfare functions) used to combine individual preferences into a coherent whole.
Category (mathematics)In mathematics, a category (sometimes called an abstract category to distinguish it from a concrete category) is a collection of "objects" that are linked by "arrows". A category has two basic properties: the ability to compose the arrows associatively and the existence of an identity arrow for each object. A simple example is the category of sets, whose objects are sets and whose arrows are functions.Cooperative game theoryGame where groups of players may enforce cooperative behaviourIn game theory, a cooperative or coalitional game is a game with groups of players who form binding "coalitions" with external enforcement of cooperative behavior (e.g. through contract law). This is different from non-cooperative games in which there is either no possibility to forge alliances or all agreements need to be self-enforcing (e.g. through credible threats).
Computational geometryBranch of computer science Computational geometry is a branch of computer science devoted to the study of algorithms that can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry. While modern computational geometry is a recent development, it is one of the oldest fields of computing with a history stretching back to antiquity.*As an Amazon Associate I earn from qualifying purchases.