Dürer graphIn the mathematical field of graph theory, the Dürer graph is an undirected graph with 12 vertices and 18 edges. It is named after Albrecht Dürer, whose 1514 engraving Melencolia…View analysis →
Voltage graphIn graph theory, a voltage graph is a directed graph whose edges are labelled invertibly by elements of a group. It is formally identical to a gain graph, but it is generally…View analysis →
Cycle graphIn graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices (at least 3, if the graph is simple)…View analysis →
BoxicityIn the mathematical field of graph theory, the boxicity of a graph is a graph invariant defined to be the minimum dimension of Euclidean space required to represent the graph as…View analysis →
Universal vertexIn graph theory, a universal vertex is a vertex of an undirected graph that is adjacent to all other vertices of the graph. It may also be called a dominating vertex, as it forms…View analysis →
Complement graphIn the mathematical field of graph theory, the complement or inverse of a graph G is a graph H on the same vertices such that two distinct vertices are adjacent (connected) in H…View analysis →
Quartic graphIn the mathematical field of graph theory, a quartic graph is a graph where all vertices have degree 4. In other words, a quartic graph is a 4-regular graph.View analysis →
Null graphIn the mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes called…View analysis →
Halved cube graphIn graph theory, the halved cube graph or half cube graph of dimension n is the vertex-edge graph of the demihypercube, formed by connecting pairs of vertices at distance exactly…View analysis →
Threshold graphIn graph theory, a threshold graph is a graph that can be constructed from a one-vertex graph by repeated applications of the following two operations:View analysis →
Regular graphIn graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency. A regular directed graph must…View analysis →
Block graphIn graph theory, a branch of combinatorial mathematics, a block graph or clique tree is a type of undirected graph in which every biconnected component (block) is a clique.View analysis →
Trapezoid graphIn graph theory, trapezoid graphs are intersection graphs of trapezoids between two horizontal lines. They are a class of co-comparability graphs that contain interval graphs and…View analysis →
Folded cube graphIn graph theory, a folded cube graph is an undirected graph formed from a hypercube graph by adding to it a perfect matching that connects opposite pairs of hypercube vertices.View analysis →
Hamming graphHamming graphs are a special class of graphs named after Richard Hamming and used in several branches of mathematics (graph theory) and computer science. Let S be a set of q…View analysis →
Laman graphIn graph theory, the Laman graphs are a family of sparse graphs describing the minimally rigid systems of rods and joints in the plane. Formally, a Laman graph is a graph on n…View analysis →
Gary ChartrandGary Theodore Chartrand (born 24 August 1936) is an American-born mathematician who specializes in graph theory. He is known for his textbooks on introductory graph theory and…View analysis →
Graph labelingIn the mathematical discipline of graph theory, a graph labeling is the assignment of labels, traditionally represented by integers, to edges and/or vertices of a graph.View analysis →
Induced pathIn the mathematical area of graph theory, an induced path in an undirected graph G is a path that is an induced subgraph of G. That is, it is a sequence of vertices in G such…View analysis →
Ptolemaic graphIn graph theory, a Ptolemaic graph is an undirected graph whose shortest path distances obey Ptolemy's inequality, which in turn was named after the Greek astronomer and…View analysis →
System of differential equationsIn mathematics, a system of differential equations is a finite set of differential equations. Such a system can be either linear or non-linear. Also, such a system can be either…View analysis →
Half graphIn graph theory, a branch of mathematics, a half graph is a special type of bipartite graph. These graphs are called the half graphs because they have approximately half of the…View analysis →
Stiffness matrixIn the finite element method for the numerical solution of elliptic partial differential equations, the stiffness matrix is a matrix that represents the system of linear…View analysis →
Tutte graphIn the mathematical field of graph theory, the Tutte graph is a 3-regular graph with 46 vertices and 69 edges named after W. T. Tutte. It has chromatic number 3, chromatic index…View analysis →
Central momentIn probability theory and statistics, a central moment is a moment of a probability distribution of a random variable about the random variable's mean; that is, it is the…View analysis →
Connected dominating setIn graph theory, a connected dominating set and a maximum leaf spanning tree are two closely related structures defined on an undirected graph.View analysis →
Liénard equationIn mathematics, more specifically in the study of dynamical systems and differential equations, a Liénard equation is a type of second-order ordinary differential equation named…View analysis →
Regular conditional probabilityIn probability theory, regular conditional probability is a concept that formalizes the notion of conditioning on the outcome of a random variable. The resulting conditional…View analysis →
Windmill graphIn the mathematical field of graph theory, the windmill graph Wd(k,n) is an undirected graph constructed for k ≥ 2 and n ≥ 2 by joining n copies of the complete graph Kk at a…View analysis →
Self-complementary graphIn the mathematical field of graph theory, a self-complementary graph is a graph which is isomorphic to its complement. The simplest non-trivial self-complementary graphs are the…View analysis →
Circular distributionIn probability and statistics, a circular distribution or polar distribution is a probability distribution of a random variable whose values are angles, usually taken to be in…View analysis →
GeometryGeometry is a branch of mathematics concerned with properties of space such as the distance, shape, size, and relative position of figures. Geometry is, along with arithmetic…View analysis →
Mathematical analysisMathematical analysis is the branch of mathematics that studies functions, spaces, and operators through quantitative methods of approximation and convergence. It grew out of…View analysis →
Stochastic processIn probability theory and related fields a stochastic (/stəˈkæstɪk/) or random process is a mathematical object usually defined as a family of random variables in a probability…View analysis →
Lie algebraIn mathematics, a Lie algebra (pronounced /liː/ LEE) is a vector space g {\displaystyle {\mathfrak {g}}} together with an operation called the Lie bracket, an alternating…View analysis →
CalculusCalculus is the branch of mathematics that studies continuous change, and is the principal precursor of modern mathematical analysis. Originally called infinitesimal calculus or…View analysis →