• 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...
    10 KB (1,132 words) - 00:50, 30 August 2024
  • Thumbnail for Connectivity (graph theory)
    mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need...
    17 KB (2,062 words) - 23:37, 25 March 2025
  • Thumbnail for Bridge (graph theory)
    In graph theory, a bridge, isthmus, cut-edge, or cut arc is an edge of a graph whose deletion increases the graph's number of connected components. Equivalently...
    11 KB (1,476 words) - 01:30, 16 June 2025
  • Graph cut may refer to: Cut (graph theory), in mathematics Graph cut optimization Graph cuts in computer vision This disambiguation page lists articles...
    153 bytes (50 words) - 16:09, 28 December 2019
  • Thumbnail for Minimum cut
    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...
    6 KB (732 words) - 17:38, 23 June 2025
  • 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...
    109 KB (16,011 words) - 12:09, 30 June 2025
  • Thumbnail for Maximum cut
    In a graph, a maximum cut is a cut whose size is at least the size of any other cut. That is, it is a partition of the graph's vertices into two complementary...
    25 KB (3,111 words) - 02:20, 25 June 2025
  • Thumbnail for Dual graph
    mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each...
    51 KB (6,607 words) - 00:16, 3 April 2025
  • 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...
    7 KB (663 words) - 02:52, 24 September 2024
  • In graph theory, an undirected graph H is called a minor of the graph G if H can be formed from G by deleting edges, vertices and by contracting edges...
    35 KB (4,045 words) - 11:35, 4 July 2025
  • Thumbnail for Geometric graph theory
    Geometric graph theory in the broader sense is a large and amorphous subfield of graph theory, concerned with graphs defined by geometric means. In a stricter...
    7 KB (934 words) - 20:16, 2 December 2024
  • In graph theory, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion. Expander...
    41 KB (5,391 words) - 22:16, 19 June 2025
  • As applied in the field of computer vision, graph cut optimization can be employed to efficiently solve a wide variety of low-level computer vision problems...
    16 KB (2,097 words) - 09:58, 9 October 2024
  • Thumbnail for Vertex (graph theory)
    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...
    6 KB (806 words) - 05:45, 12 April 2025
  • Thumbnail for Complete graph
    In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique...
    14 KB (1,253 words) - 18:25, 9 May 2025
  • Thumbnail for Kőnig's theorem (graph theory)
    In the mathematical area of graph theory, Kőnig's theorem, proved by Dénes Kőnig (1931), describes an equivalence between the maximum matching problem...
    24 KB (3,433 words) - 02:46, 12 December 2024
  • Thumbnail for Conductance (graph theory)
    In theoretical computer science, graph theory, and mathematics, the conductance is a parameter of a Markov chain that is closely tied to its mixing time...
    9 KB (1,428 words) - 07:38, 17 June 2025
  • Thumbnail for Random graph
    The theory of random graphs lies at the intersection between graph theory and probability theory. From a mathematical perspective, random graphs are used...
    15 KB (2,307 words) - 11:46, 21 March 2025
  • terminal for mainframe computers Cut (graph theory) Cut (manga), a 2008 Japanese manga Cut (novel), by Patricia McCormick Cut (censorship), removal of a scene...
    4 KB (549 words) - 02:18, 4 May 2025
  • Thumbnail for Graph theory
    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...
    50 KB (6,237 words) - 21:13, 9 May 2025
  • In mathematics, spectral graph theory is the study of the properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors...
    15 KB (1,844 words) - 20:28, 19 February 2025
  • Thumbnail for Biconnected component
    In graph theory, a biconnected component or block (sometimes known as a 2-connected component) is a maximal biconnected subgraph. Any connected graph decomposes...
    12 KB (1,398 words) - 11:33, 21 June 2025
  • Thumbnail for Cactus graph
    In graph theory, a cactus (sometimes called a cactus tree) is a connected graph in which any two simple cycles have at most one vertex in common. Equivalently...
    13 KB (1,684 words) - 20:51, 27 February 2025
  • Thumbnail for Cubic graph
    of graph theory, a cubic graph is a graph in which all vertices have degree three. In other words, a cubic graph is a 3-regular graph. Cubic graphs are...
    15 KB (1,777 words) - 22:39, 19 June 2025
  • al. (2013). Two common examples of graph partitioning are minimum cut and maximum cut problems. Typically, graph partition problems fall under the category...
    25 KB (2,979 words) - 01:25, 19 June 2025
  • Thumbnail for Petersen graph
    bridgeless graph has a cycle-continuous mapping to the Petersen graph. More unsolved problems in mathematics In the mathematical field of graph theory, the...
    24 KB (2,993 words) - 04:57, 12 April 2025
  • discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential...
    195 KB (20,069 words) - 08:05, 26 June 2025
  • In the mathematical field of graph theory, the Laplacian matrix, also called the graph Laplacian, admittance matrix, Kirchhoff matrix, or discrete Laplacian...
    45 KB (5,042 words) - 19:15, 16 May 2025
  • after the concept of cut in the theory of flow networks. Thanks to the max-flow min-cut theorem, determining the minimum cut over a graph representing a flow...
    26 KB (4,236 words) - 02:10, 25 June 2025
  • cuckoo hashing cuckoo filter cut (graph theory) cut (logic programming) cutting plane cutting stock problem cutting theorem cut vertex cycle sort cyclic redundancy...
    35 KB (3,135 words) - 18:46, 6 May 2025