In mathematics, a graph partition is the reduction of a graph to a smaller graph by partitioning its set of nodes into mutually exclusive groups. Edges...

In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. Any cut determines a cut-set, the set of edges that have one...

or an ordered partition of a set, partition of a graph, partition of an integer, partition of an interval, partition of unity, partition of a matrix; see...

In graph theory, a part of mathematics, a k-partite graph is a graph whose vertices are (or can be) partitioned into k different independent sets. Equivalently...

combinatorics and mathematical physics ,a partition of a non-negative integer n, also called an integer partition, is a way of writing n as a sum of positive...

The components of any graph partition its vertices into disjoint sets, and are the induced subgraphs of those sets. A graph that is itself connected...

directed graph form a partition into subgraphs that are themselves strongly connected. It is possible to test the strong connectivity of a graph, or to...

Bivariegated graph Cage (graph theory) Cayley graph Circle graph Clique graph Cograph Common graph Complement of a graph Complete graph Cubic graph Cycle graph De...

In graph theory, a discipline within mathematics, the frequency partition of a graph (simple graph) is a partition of its vertices grouped by their degree...

In graph theory, the weak components of a directed graph partition the vertices of the graph into subsets that are totally ordered by reachability. They...

topological space Plane partition, in mathematics and especially combinatorics Graph partition, the reduction of a graph to a smaller graph Folding screen, a...

In essence, extremal graph theory studies how global properties of a graph influence local substructure. Results in extremal graph theory deal with quantitative...

In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges...

one way to partition its vertices into k independent sets and there is no way to partition them into k − 1 independent sets. A complete graph is uniquely...

In graph theory, a minimum cut or min-cut of a graph is a cut (a partition of the vertices of a graph into two disjoint subsets) that is minimal in some...

common coarsening of them all; in graph-theoretic terms, it is the partition of the vertices of the complete graph into the connected components of the...

In graph theory, a branch of mathematics, a split graph is a graph in which the vertices can be partitioned into a clique and an independent set. Split...

function aggregateGraph returns a new graph whose vertices are the partition of the old graph, and whose edges are calculated using the old graph. This function...

well-known heuristics for two NP-complete optimization problems: graph partitioning and the travelling salesman problem. In a display of authorial equity...

METIS is a software package for graph partitioning that implements various multilevel algorithms. METIS' multilevel approach has three phases and comes...

The Turán graph, denoted by T ( n , r ) {\displaystyle T(n,r)} , is a complete multipartite graph; it is formed by partitioning a set of n {\displaystyle...

In extremal graph theory, Szemerédi’s regularity lemma states that a graph can be partitioned into a bounded number of parts so that the edges between...

science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph theory within...

Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...

In graph theory, a quotient graph Q of a graph G is a graph whose vertices are blocks of a partition of the vertices of G and where block B is adjacent...

of vertices in weighted directed graphs. The k-path partition problem is the problem of partitioning a given graph to a smallest collection of vertex-disjoint...

{\displaystyle B_{+}} and the rest in B − {\displaystyle B_{-}} , thus bi-partitioning the graph and labeling the data points with two labels. This sign-based approach...

k-regular subgraph, and a k-factorization partitions the edges of the graph into disjoint k-factors. A graph G is said to be k-factorable if it admits...

vertex set: GT7  Feedback arc set: GT8  Graph coloring: GT4  Graph homomorphism problem: GT52  Graph partition into subgraphs of specific types (triangles...

computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge (u...