• Thumbnail for 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...
    28 KB (3,689 words) - 15:58, 20 December 2024
  • Thumbnail for Discrete mathematics
    discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics"...
    26 KB (2,771 words) - 02:35, 23 December 2024
  • up Graph, graph, or -graph in Wiktionary, the free dictionary. Wikimedia Commons has media related to Graphs. Graph may refer to: Graph (discrete mathematics)...
    1 KB (186 words) - 21:14, 30 November 2024
  • algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set...
    190 KB (19,551 words) - 19:36, 11 December 2024
  • property of varying "smoothly", the objects studied in discrete mathematics – such as integers, graphs, and statements in logic – do not vary smoothly in...
    10 KB (1,833 words) - 06:05, 22 August 2024
  • Thumbnail for Graph theory
    in discrete mathematics. Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures...
    49 KB (6,194 words) - 18:33, 21 December 2024
  • Thumbnail for Outerplanar graph
    outerplanar graphs", Discrete Mathematics, 26 (1): 47–53, doi:10.1016/0012-365X(79)90060-8. Sysło, Maciej M.; Proskurowski, Andrzej (1983), "On Halin graphs", Graph...
    18 KB (2,061 words) - 07:18, 21 July 2024
  • mathematics, the discrete Laplace operator is an analog of the continuous Laplace operator, defined so that it has meaning on a graph or a discrete grid...
    34 KB (5,719 words) - 18:39, 2 December 2024
  • Thumbnail for Circle graph
    (1985), "On the chromatic number of multiple interval graphs and overlap graphs", Discrete Mathematics, 55 (2): 161–166, doi:10.1016/0012-365X(85)90044-5...
    15 KB (1,694 words) - 07:51, 18 July 2024
  • Thumbnail for Discrete geometry
    geometry, combinatorial optimization, digital geometry, discrete differential geometry, geometric graph theory, toric geometry, and combinatorial topology...
    15 KB (1,575 words) - 05:36, 16 October 2024
  • Thumbnail for Inversion (discrete mathematics)
    In computer science and discrete mathematics, an inversion in a sequence is a pair of elements that are out of their natural order. Let π {\displaystyle...
    15 KB (1,903 words) - 03:11, 4 January 2024
  • Thumbnail for Bipartite graph
    In 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...
    33 KB (4,093 words) - 00:09, 21 October 2024
  • Thumbnail for Perfect graph
    Di Stefano, Gabriele (1999). "Graph classes between parity and distance-hereditary graphs". Discrete Applied Mathematics. 95 (1–3): 197–216. doi:10...
    59 KB (7,054 words) - 11:33, 16 December 2024
  • Thumbnail for Complete bipartite graph
    In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first...
    12 KB (960 words) - 06:50, 16 December 2024
  • on discrete and combinatorial objects. It started as a part of combinatorics and graph theory, but is now viewed as a branch of applied mathematics and...
    32 KB (3,432 words) - 12:41, 6 November 2024
  • colourable graphs", Advances in Graph Theory (Cambridge Combinatorial Conf., Trinity College, Cambridge, 1977), Annals of Discrete Mathematics, vol. 3,...
    10 KB (1,038 words) - 23:28, 23 September 2024
  • Thumbnail for Cluster graph
    In graph theory, a branch of mathematics, a cluster graph is a graph formed from the disjoint union of complete graphs. Equivalently, a graph is a cluster...
    6 KB (647 words) - 06:47, 25 June 2023
  • Discrete Mathematics is a biweekly peer-reviewed scientific journal in the broad area of discrete mathematics, combinatorics, graph theory, and their...
    3 KB (186 words) - 20:23, 7 May 2024
  • Thumbnail for 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:...
    6 KB (805 words) - 08:53, 15 February 2024
  • A three-dimensional graph may refer to A graph (discrete mathematics), embedded into a three-dimensional space The graph of a function of two variables...
    224 bytes (63 words) - 10:09, 1 March 2017
  • 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) - 04:06, 21 December 2024
  • Thumbnail for Degree (graph theory)
    In graph theory, the degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex; in a multigraph, a loop contributes...
    10 KB (1,276 words) - 13:10, 18 November 2024
  • Thumbnail for Interval graph
    interval graphs", SIAM Journal on Discrete Mathematics, 23 (4): 1905–1953, doi:10.1137/S0895480100373455 Eckhoff, Jürgen (1993), "Extremal interval graphs",...
    22 KB (2,640 words) - 01:39, 27 August 2024
  • Thumbnail for Subcoloring
    Subcoloring (category Graph coloring)
    Hedetniemi, S. T.; Locke, S. C. (1989), "The subchromatic number of a graph", Discrete Mathematics, 74 (1–2): 33–49, doi:10.1016/0012-365X(89)90196-9. Broersma...
    5 KB (441 words) - 08:44, 16 July 2024
  • Barnette's conjecture (category Unsolved problems in graph theory)
    Unsolved problem in mathematics: Is every cubic bipartite polyhedral graph Hamiltonian? (more unsolved problems in mathematics) Barnette's conjecture is...
    11 KB (1,194 words) - 07:50, 18 July 2024
  • Thumbnail for Connectivity (graph theory)
    In 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)...
    17 KB (2,062 words) - 20:41, 26 September 2024
  • Discrete optimization is a branch of optimization in applied mathematics and computer science. As opposed to continuous optimization, some or all of the...
    2 KB (174 words) - 15:49, 12 July 2024
  • Thumbnail for Directed acyclic graph
    In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it...
    45 KB (5,647 words) - 02:14, 6 December 2024
  • Thumbnail for Directed graph
    In 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...
    16 KB (1,937 words) - 23:03, 22 December 2024
  • time of a graph", Discrete Mathematics, 309 (18): 5588–5595, doi:10.1016/j.disc.2008.04.004, MR 2567962 Gavenčiak, Tomáš (2010), "Cop-win graphs with maximum...
    24 KB (3,239 words) - 03:09, 23 May 2023