Find link

language:

jump to random article

view article
Find link is a tool written by Edward Betts.

searching for Graph 545 found (23530 total)

alternate case: graph

Tree (graph theory) (3,383 words) [view diff] exact match in snippet view article

In graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected
Graph coloring (8,459 words) [view diff] exact match in snippet view article find links to article
In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain
Glossary of graph theory (16,011 words) [view diff] exact match in snippet view article find links to article
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
Directed graph (1,937 words) [view diff] exact match in snippet view article find links to article
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
Dijkstra's algorithm (5,637 words) [view diff] exact match in snippet view article find links to article
an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, a road network. It was conceived by computer
Graph of a function (961 words) [view diff] exact match in snippet view article find links to article
In mathematics, the graph of a function f {\displaystyle f} is the set of ordered pairs ( x , y ) {\displaystyle (x,y)} , where f ( x ) = y . {\displaystyle
Directed acyclic graph (5,646 words) [view diff] exact match in snippet view article find links to article
In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it
Planar graph (4,541 words) [view diff] exact match in snippet view article find links to article
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect
Bar chart (1,311 words) [view diff] exact match in snippet view article find links to article
A bar chart or bar graph is a chart or graph that presents categorical data with rectangular bars with heights or lengths proportional to the values that
Combinatorics (3,524 words) [view diff] exact match in snippet view article find links to article
right. One of the oldest and most accessible parts of combinatorics is graph theory, which by itself has numerous natural connections to other areas
Vertex (graph theory) (806 words) [view diff] exact match in snippet view article
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
Cube (6,298 words) [view diff] exact match in snippet view article find links to article
ways, one of which is the graph known as the cubical graph. It can be constructed by using the Cartesian product of graphs. The cube is the three-dimensional
Connectivity (graph theory) (2,062 words) [view diff] exact match in snippet view article
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
Bipartite graph (4,093 words) [view diff] exact match in snippet view article find links to article
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
Radius (1,199 words) [view diff] exact match in snippet view article find links to article
apothem. In graph theory, the radius of a graph is the minimum over all vertices u of the maximum distance from u to any other vertex of the graph. The radius
Graph database (4,745 words) [view diff] exact match in snippet view article find links to article
A graph database (GDB) is a database that uses graph structures for semantic queries with nodes, edges, and properties to represent and store data. A key
Hamiltonian path (2,043 words) [view diff] exact match in snippet view article find links to article
the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly
Adjacency matrix (2,453 words) [view diff] exact match in snippet view article find links to article
In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether
Graph drawing (3,275 words) [view diff] exact match in snippet view article find links to article
Graph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimensional
Google Knowledge Graph (1,366 words) [view diff] exact match in snippet view article find links to article
The Google Knowledge Graph is a knowledge base from which Google serves relevant information in an infobox beside its search results. This allows the
Logarithmic scale (1,203 words) [view diff] exact match in snippet view article find links to article
25). Exponential growth curves are often depicted on a logarithmic scale graph. The markings on slide rules are arranged in a log scale for multiplying
Complete graph (1,253 words) [view diff] exact match in snippet view article find links to article
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
Octahedron (3,708 words) [view diff] exact match in snippet view article find links to article
graph—its edges remain connected whenever two of more three vertices of a graph are removed. Its graph called the octahedral graph, a Platonic graph.
Degree (graph theory) (1,276 words) [view diff] exact match in snippet view article
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
Graph (abstract data type) (1,763 words) [view diff] exact match in snippet view article
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
Facebook Platform (2,403 words) [view diff] exact match in snippet view article find links to article
interfaces and tools which enable developers to integrate with the open "social graph" of personal relations and other things like songs, places, and Facebook
Graphical model (1,278 words) [view diff] exact match in snippet view article find links to article
or structured probabilistic model is a probabilistic model for which a graph expresses the conditional dependence structure between random variables
Statistics of the COVID-19 pandemic in Serbia (224 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
BC Ferries (2,905 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Clique (graph theory) (2,501 words) [view diff] exact match in snippet view article
In graph theory, a clique (/ˈkliːk/ or /ˈklɪk/) is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are
Graph paper (973 words) [view diff] exact match in snippet view article find links to article
Graph paper, coordinate paper, grid paper, or squared paper is writing paper that is printed with fine lines making up a regular grid. It is available
Path (graph theory) (1,175 words) [view diff] exact match in snippet view article
In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct
Scatter plot (1,328 words) [view diff] exact match in snippet view article find links to article
A scatter plot, also called a scatterplot, scatter graph, scatter chart, scattergram, or scatter diagram, is a type of plot or mathematical diagram using
DOT (graph description language) (980 words) [view diff] exact match in snippet view article
DOT is a graph description language, developed as a part of the Graphviz project. DOT graphs are typically stored as files with the .gv or .dot filename
Depth-first search (2,447 words) [view diff] exact match in snippet view article find links to article
tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores
Slope (2,704 words) [view diff] exact match in snippet view article find links to article
line has unit slope: m = 1 {\displaystyle m=1} A "horizontal" line (the graph of a constant function) has zero slope: m = 0 {\displaystyle m=0} . A "vertical"
Signal processing (2,277 words) [view diff] exact match in snippet view article find links to article
graph. Graph signal processing presents several key points such as sampling signal techniques, recovery techniques and time-varying techiques. Graph signal
Cartesian coordinate system (5,520 words) [view diff] exact match in snippet view article find links to article
calculus, group theory and more. A familiar example is the concept of the graph of a function. Cartesian coordinates are also essential tools for most applied
Flow network (3,081 words) [view diff] exact match in snippet view article find links to article
In graph theory, a flow network (also known as a transportation network) is a directed graph where each edge has a capacity and each edge receives a flow
Logic optimization (1,657 words) [view diff] no match in snippet view article find links to article
Logic optimization is a process of finding an equivalent representation of the specified logic circuit under one or more specified constraints. This process
Random graph (2,328 words) [view diff] exact match in snippet view article find links to article
In mathematics, random graph is the general term to refer to probability distributions over graphs. Random graphs may be described simply by a probability
Shortest path problem (4,764 words) [view diff] exact match in snippet view article find links to article
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights
List of unsolved problems in mathematics (20,026 words) [view diff] exact match in snippet view article find links to article
combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory
Distance (graph theory) (933 words) [view diff] exact match in snippet view article
mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path (also called a graph geodesic) connecting
A* search algorithm (5,536 words) [view diff] exact match in snippet view article find links to article
A* (pronounced "A-star") is a graph traversal and pathfinding algorithm that is used in many fields of computer science due to its completeness, optimality
A* search algorithm (5,536 words) [view diff] exact match in snippet view article find links to article
A* (pronounced "A-star") is a graph traversal and pathfinding algorithm that is used in many fields of computer science due to its completeness, optimality
COVID-19 pandemic in Jharkhand (285 words) [view diff] exact match in snippet view article find links to article
Family Welfare on their website. Source: covid19india.org Graph source: Data from MoHFW Graph source: Data from covid19india.org COVID-19 pandemic in India
Incidence matrix (1,287 words) [view diff] exact match in snippet view article find links to article
common graph representation in graph theory. It is different to an adjacency matrix, which encodes the relation of vertex-vertex pairs. In graph theory
Four color theorem (6,277 words) [view diff] exact match in snippet view article find links to article
terms of graph theory, by considering it in terms of constructing a graph coloring of the planar graph of adjacencies between regions. In graph-theoretic
DirectShow (3,802 words) [view diff] exact match in snippet view article find links to article
the rendering process, the filter graph searches the Windows Registry for registered filters and builds its graph of filters based on the locations provided
Travelling salesman problem (11,633 words) [view diff] exact match in snippet view article find links to article
version of the TSP (where given a length L, the task is to decide whether the graph has a tour whose length is at most L) belongs to the class of NP-complete
Elections in Italy (1,591 words) [view diff] exact match in snippet view article find links to article
Action - Italia Viva came in second, third and fourth respectively. This graph shows the results of elections held in Italy from 1946 to 2018, with the
Structurae (284 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 vaccination in Turkey (368 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Hypergraph (6,817 words) [view diff] exact match in snippet view article find links to article
hypergraph is a generalization of a graph in which an edge can join any number of vertices. In contrast, in an ordinary graph, an edge connects exactly two
NoSQL (2,437 words) [view diff] exact match in snippet view article find links to article
databases use a single data structure—such as key–value pairs, wide columns, graphs, or documents—to hold information. Since this non-relational design does
Independent set (graph theory) (3,561 words) [view diff] exact match in snippet view article
In graph theory, an independent set, stable set, coclique or anticlique is a set of vertices in a graph, no two of which are adjacent. That is, it is a
Minimum spanning tree (5,460 words) [view diff] exact match in snippet view article find links to article
tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the
Breadth-first search (1,858 words) [view diff] exact match in snippet view article find links to article
for the graph itself, which may vary depending on the graph representation used by an implementation of the algorithm. When working with graphs that are
Component (graph theory) (3,441 words) [view diff] exact match in snippet view article
In graph theory, a component of an undirected graph is a connected subgraph that is not part of any larger connected subgraph. The components of any graph
Genus (mathematics) (1,412 words) [view diff] exact match in snippet view article
of orientable surfaces Planar graph: genus 0 Toroidal graph: genus 1 Teapot: Double Toroidal graph: genus 2 Pretzel graph: genus 3 The non-orientable genus
Integral (9,288 words) [view diff] exact match in snippet view article find links to article
computes the signed area of the region in the plane that is bounded by the graph of a given function between two points in the real line. Conventionally
Graphviz (752 words) [view diff] exact match in snippet view article find links to article
Graphviz (short for Graph Visualization Software) is a package of open-source tools initiated by AT&T Labs Research for drawing graphs (as in nodes and edges
Small-world network (4,646 words) [view diff] exact match in snippet view article find links to article
network example Hubs are bigger than other nodes A small-world network is a graph characterized by a high clustering coefficient and low distances. In an
Topological sorting (3,170 words) [view diff] exact match in snippet view article find links to article
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
Prim's algorithm (2,079 words) [view diff] exact match in snippet view article find links to article
algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes
Convex polytope (3,273 words) [view diff] exact match in snippet view article find links to article
isomorphic if their face lattices are isomorphic. The polytope graph (polytopal graph, graph of the polytope, 1-skeleton) is the set of vertices and edges
COVID-19 vaccination in Burkina Faso (415 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Closed graph theorem (functional analysis) (2,719 words) [view diff] exact match in snippet view article
analysis, the closed graph theorem is a result connecting the continuity of a linear operator to a topological property of their graph. Precisely, the theorem
Eulerian path (3,296 words) [view diff] exact match in snippet view article find links to article
In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph that visits every edge exactly once (allowing for revisiting vertices)
Statistics of the COVID-19 pandemic in India (3,095 words) [view diff] exact match in snippet view article find links to article
recoveries, and other statistics are shown in nationwide and regional maps and graphs. The Indian Council of Medical Research (ICMR) governs classification of
Social graph (1,482 words) [view diff] exact match in snippet view article find links to article
social graph is a graph that represents social relations between entities. It is a model or representation of a social network. The social graph has been
Laplacian matrix (5,042 words) [view diff] exact match in snippet view article find links to article
In the mathematical field of graph theory, the Laplacian matrix, also called the graph Laplacian, admittance matrix, Kirchhoff matrix, or discrete Laplacian
List of algorithms (7,945 words) [view diff] exact match in snippet view article find links to article
Mersenne Twister Coloring algorithm: Graph coloring algorithm. Hopcroft–Karp algorithm: convert a bipartite graph to a maximum cardinality matching Hungarian
Asymptote (4,527 words) [view diff] exact match in snippet view article find links to article
oblique. For curves given by the graph of a function y = ƒ(x), horizontal asymptotes are horizontal lines that the graph of the function approaches as x
HMS Graph (6,410 words) [view diff] exact match in snippet view article find links to article
HMS Graph (pennant number P715) was a German Type VIIC U-boat captured and recommissioned by the British Royal Navy during World War II. Commissioned
Last.fm (5,913 words) [view diff] no match in snippet view article find links to article
Last.fm is a music website founded in the United Kingdom in 2002. Utilizing a music recommender system known as "Audioscrobbler", Last.fm creates a detailed
Statistics of the COVID-19 pandemic in Argentina (1,279 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 vaccination in France (687 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Pie chart (2,340 words) [view diff] exact match in snippet view article find links to article
credited to William Playfair's Statistical Breviary of 1801, in which two such graphs are used. Playfair presented an illustration, which contained a series of
Contour line (4,492 words) [view diff] exact match in snippet view article find links to article
joins points of equal value. It is a plane section of the three-dimensional graph of the function f ( x , y ) {\displaystyle f(x,y)} parallel to the ( x
Discrete mathematics (2,771 words) [view diff] exact match in snippet view article find links to article
continuous functions). Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics
Translation (geometry) (1,720 words) [view diff] exact match in snippet view article
graph consisting of points ⁠ ( x , f ( x − a ) ) {\displaystyle (x,f(x-a))} ⁠. Each point ⁠ ( x , y ) {\displaystyle (x,y)} ⁠ of the original graph corresponds
COVID-19 vaccination in Algeria (638 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Cyclic group (4,312 words) [view diff] exact match in snippet view article find links to article
graph is a cycle graph, and for an infinite cyclic group with its generator the Cayley graph is a doubly infinite path graph. However, Cayley graphs can
Survival function (2,086 words) [view diff] exact match in snippet view article find links to article
The graphs below show examples of hypothetical survival functions. The x-axis is time. The y-axis is the proportion of subjects surviving. The graphs show
Population pyramid (2,272 words) [view diff] exact match in snippet view article find links to article
A population pyramid (age structure diagram) or "age-sex pyramid" is a graphical illustration of the distribution of a population (typically that of a
Open Tree of Life (306 words) [view diff] exact match in snippet view article find links to article
including 2.3 million species, was released in September 2015. The Interactive graph allows the user to zoom in to taxonomic classifications, phylogenetic trees
Parsing (4,881 words) [view diff] exact match in snippet view article find links to article
languages with layered graph grammars." Journal of Visual Languages & Computing 8.1 (1997): 27-55. Rekers, Jan, and A. Schurr. "A graph grammar approach to
Adampur Airport (1,267 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Cayley graph (4,692 words) [view diff] exact match in snippet view article find links to article
In mathematics, a Cayley graph, also known as a Cayley color graph, Cayley diagram, group diagram, or color group, is a graph that encodes the abstract
Tree (abstract data type) (2,207 words) [view diff] exact match in snippet view article
children is specified, this data structure corresponds to an ordered tree in graph theory. A value or pointer to other data may be associated with every node
Graph traversal (1,492 words) [view diff] exact match in snippet view article find links to article
computer science, graph traversal (also known as graph search) refers to the process of visiting (checking and/or updating) each vertex in a graph. Such traversals
COVID-19 pandemic in Madhya Pradesh (1,349 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Common Logic (456 words) [view diff] exact match in snippet view article find links to article
Common Logic Conceptual graph Knowledge Interchange Format (KIF) Knowledge representation languages Sowa, John F. "Conceptual graphs summary." Conceptual
COVID-19 vaccination in Algeria (638 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
PageRank (8,808 words) [view diff] exact match in snippet view article find links to article
The PageRank of an undirected graph G {\displaystyle G} is statistically close to the degree distribution of the graph G {\displaystyle G} , but they
Common Logic (456 words) [view diff] exact match in snippet view article find links to article
Common Logic Conceptual graph Knowledge Interchange Format (KIF) Knowledge representation languages Sowa, John F. "Conceptual graphs summary." Conceptual
Microsoft Academic (830 words) [view diff] no match in snippet view article find links to article
Microsoft Academic was a free internet-based academic search engine for academic publications and literature, developed by Microsoft Research in 2016 as
Misleading graph (4,196 words) [view diff] exact match in snippet view article find links to article
In statistics, a misleading graph, also known as a distorted graph, is a graph that misrepresents data, constituting a misuse of statistics and with the
Semantic network (3,532 words) [view diff] exact match in snippet view article find links to article
used as a form of knowledge representation. It is a directed or undirected graph consisting of vertices, which represent concepts, and edges, which represent
Kruskal's algorithm (1,829 words) [view diff] exact match in snippet view article find links to article
algorithm finds a minimum spanning forest of an undirected edge-weighted graph. If the graph is connected, it finds a minimum spanning tree. It is a greedy algorithm
COVID-19 vaccination in Chad (352 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Cayley graph (4,692 words) [view diff] exact match in snippet view article find links to article
In mathematics, a Cayley graph, also known as a Cayley color graph, Cayley diagram, group diagram, or color group, is a graph that encodes the abstract
COVID-19 vaccination in Senegal (668 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Regular graph (857 words) [view diff] exact match in snippet view article find links to article
In 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
Linear function (652 words) [view diff] exact match in snippet view article find links to article
notions: In calculus and related areas, a linear function is a function whose graph is a straight line, that is, a polynomial function of degree zero or one
Party-list representation in the House of Representatives of the Philippines (4,191 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Truncated icosahedron (1,563 words) [view diff] exact match in snippet view article find links to article
represented as a polyhedral graph, meaning a planar graph (one that can be drawn without crossing edges) and 3-vertex-connected graph (remaining connected whenever
COVID-19 vaccination in Egypt (571 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 vaccination in Djibouti (332 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 vaccination in the Comoros (203 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
David Eppstein (841 words) [view diff] exact match in snippet view article find links to article
work on minimum spanning trees, shortest paths, dynamic graph data structures, graph coloring, graph drawing and geometric optimization. He has published
COVID-19 vaccination in the United Arab Emirates (719 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Finistère (665 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Regular icosahedron (4,617 words) [view diff] exact match in snippet view article find links to article
is an example of a Platonic solid and of a deltahedron. The icosahedral graph represents the skeleton of a regular icosahedron. Many polyhedra are constructed
Length (1,127 words) [view diff] exact match in snippet view article find links to article
the sphere. In an unweighted graph, the length of a cycle, path, or walk is the number of edges it uses. In a weighted graph, it may instead be the sum
COVID-19 pandemic in Nagaland (820 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
LinkedIn (12,788 words) [view diff] exact match in snippet view article find links to article
analytics Inspired by Facebook's "social graph", LinkedIn CEO Jeff Weiner set a goal in 2012 to create an "economic graph" within a decade. The goal was to create
Cubic function (1,746 words) [view diff] exact match in snippet view article find links to article
odd-degree polynomials with real coefficients have at least one real root. The graph of a cubic function always has a single inflection point. It may have two
Knowledge graph (2,342 words) [view diff] exact match in snippet view article find links to article
knowledge graph is a knowledge base that uses a graph-structured data model or topology to represent and operate on data. Knowledge graphs are often used
Graph neural network (4,593 words) [view diff] exact match in snippet view article find links to article
Graph neural networks (GNN) are specialized artificial neural networks that are designed for tasks whose inputs are graphs. One prominent example is molecular
Floyd–Warshall algorithm (3,071 words) [view diff] exact match in snippet view article find links to article
algorithm) is an algorithm for finding shortest paths in a directed weighted graph with positive or negative edge weights (but with no negative cycles). A
Girth (graph theory) (903 words) [view diff] exact match in snippet view article
In graph theory, the girth of an undirected graph is the length of a shortest cycle contained in the graph. If the graph does not contain any cycles (that
Erdős–Rényi model (2,795 words) [view diff] exact match in snippet view article find links to article
mathematical field of graph theory, the Erdős–Rényi model refers to one of two closely related models for generating random graphs or the evolution of a
Centrality (6,738 words) [view diff] exact match in snippet view article find links to article
In graph theory and network analysis, indicators of centrality assign numbers or rankings to nodes within a graph corresponding to their network position
Radar chart (2,497 words) [view diff] exact match in snippet view article find links to article
measures. The radar chart is also known as web chart, spider chart, spider graph, spider web chart, star chart, star plot, cobweb chart, irregular polygon
Paul Erdős (5,402 words) [view diff] exact match in snippet view article find links to article
20th century. Erdős pursued and proposed problems in discrete mathematics, graph theory, number theory, mathematical analysis, approximation theory, set
Marne (department) (654 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Oise (467 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Euler characteristic (3,461 words) [view diff] exact match in snippet view article find links to article
plane graphs by the same   V − E + F   {\displaystyle \ V-E+F\ } formula as for polyhedral surfaces, where F is the number of faces in the graph, including
COVID-19 vaccination in Cameroon (338 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Plot (graphics) (2,604 words) [view diff] exact match in snippet view article
plot is a graphical technique for representing a data set, usually as a graph showing the relationship between two or more variables. The plot can be
Cuboctahedron (2,142 words) [view diff] exact match in snippet view article find links to article
graph, one of the Archimedean graph. It has 12 vertices and 24 edges. It is quartic graph, which is four vertices connecting each vertex. The graph of
COVID-19 vaccination in Equatorial Guinea (484 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Rhombicosidodecahedron (1,115 words) [view diff] exact match in snippet view article find links to article
pentagrammic prisms. In the mathematical field of graph theory, a rhombicosidodecahedral graph is the graph of vertices and edges of the rhombicosidodecahedron
Spanning tree (3,280 words) [view diff] exact match in snippet view article find links to article
of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G. In general, a graph may
Tree structure (966 words) [view diff] exact match in snippet view article find links to article
(data structure) for computer science; insofar as it relates to graph theory, see tree (graph theory) or tree (set theory). Other related articles are listed
Cumulative distribution function (3,993 words) [view diff] exact match in snippet view article find links to article
two red rectangles and their extensions to the right or left up to the graph of F X {\displaystyle F_{X}} ).[clarification needed] In particular, we
Derivative (7,280 words) [view diff] exact match in snippet view article find links to article
chosen input value, when it exists, is the slope of the tangent line to the graph of the function at that point. The tangent line is the best linear approximation
Neighbourhood (graph theory) (1,122 words) [view diff] exact match in snippet view article
graph theory, an adjacent vertex of a vertex v in a graph is a vertex that is connected to v by an edge. The neighbourhood of a vertex v in a graph G
Line chart (779 words) [view diff] exact match in snippet view article find links to article
A line chart or line graph, also known as curve chart, is a type of chart that displays information as a series of data points called 'markers' connected
COVID-19 pandemic in Gabon (942 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Pyrénées-Atlantiques (1,232 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Eure (497 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 vaccination in Eswatini (479 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Cumulative distribution function (3,993 words) [view diff] exact match in snippet view article find links to article
two red rectangles and their extensions to the right or left up to the graph of F X {\displaystyle F_{X}} ).[clarification needed] In particular, we
Discrete geometry (1,575 words) [view diff] exact match in snippet view article find links to article
polytope, unit disk graphs, and visibility graphs. Topics in this area include: Graph drawing Polyhedral graphs Random geometric graphs Voronoi diagrams
Line chart (779 words) [view diff] exact match in snippet view article find links to article
A line chart or line graph, also known as curve chart, is a type of chart that displays information as a series of data points called 'markers' connected
COVID-19 vaccination in Burundi (415 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Saitama (city) (1,888 words) [view diff] exact match in snippet view article
6 °F), and lowest in January, at around 3.9 °C (39.0 °F). See or edit raw graph data. Per Japanese census data, the population of Saitama has increased
Côte-d'Or (891 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 pandemic in Gabon (942 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Hasse diagram (1,342 words) [view diff] exact match in snippet view article find links to article
automatically using graph drawing techniques. In some sources, the phrase "Hasse diagram" has a different meaning: the directed acyclic graph obtained from
Graph isomorphism (1,638 words) [view diff] exact match in snippet view article find links to article
In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H f : V ( G ) → V ( H ) {\displaystyle f\colon V(G)\to
Microsoft Automatic Graph Layout (286 words) [view diff] exact match in snippet view article find links to article
Microsoft Automatic Graph Layout (MSAGL) is a .NET library for automatic graph layout. It was created by Lev Nachmanson at Microsoft Research. Earlier
Lot-et-Garonne (449 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 vaccination in Hungary (677 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Boost (C++ libraries) (805 words) [view diff] exact match in snippet view article
Siek, Jeremy G.; Lee, Lie-Quan & Lumsdaine, Andrew (2001). The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley. ISBN 978-0-201-72914-6
COVID-19 vaccination in Angola (1,111 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Neighbourhood (graph theory) (1,122 words) [view diff] exact match in snippet view article
graph theory, an adjacent vertex of a vertex v in a graph is a vertex that is connected to v by an edge. The neighbourhood of a vertex v in a graph G
Eure (497 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Emirate of Dubai (1,218 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Tangent (4,113 words) [view diff] exact match in snippet view article find links to article
differentiable curve can also be thought of as a tangent line approximation, the graph of the affine function that best approximates the original function at the
Simplified Molecular Input Line Entry System (3,645 words) [view diff] exact match in snippet view article find links to article
nodes encountered in a depth-first tree traversal of a chemical graph. The chemical graph is first trimmed to remove hydrogen atoms and cycles are broken
COVID-19 pandemic in Bihar (2,573 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Complete bipartite graph (960 words) [view diff] exact match in snippet view article find links to article
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
Seismic wave (2,383 words) [view diff] no match in snippet view article find links to article
A seismic wave is a mechanical wave of acoustic energy that travels through the Earth or another planetary body. It can result from an earthquake (or generally
Morbihan (603 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Sarthe (627 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 vaccination in the Democratic Republic of the Congo (524 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Cubic graph (1,777 words) [view diff] exact match in snippet view article find links to article
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
COVID-19 vaccination in Zimbabwe (774 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Vienne (department) (599 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Haute-Garonne (666 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Jura (department) (799 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Chinese Academy of Medical Sciences COVID-19 vaccine (192 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Convex function (5,855 words) [view diff] exact match in snippet view article find links to article
line segment between any two distinct points on the graph of the function lies above or on the graph between the two points. Equivalently, a function is
Abstraction (4,777 words) [view diff] exact match in snippet view article find links to article
they are not abstract in the sense of the objects in graph 1 below. We might look at other graphs, in a progression from cat to mammal to animal, and see
Graph minor (4,046 words) [view diff] exact match in snippet view article find links to article
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
COVID-19 pandemic in Transnistria (834 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Bellman–Ford algorithm (2,854 words) [view diff] exact match in snippet view article find links to article
for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. The algorithm was
COVID-19 pandemic in the Federated States of Micronesia (931 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 vaccination in Morocco (1,097 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Decision tree (3,463 words) [view diff] exact match in snippet view article find links to article
Concept map Conceptual graph Decision tree Dendrogram Graph drawing Hyperbolic tree Hypertext Issue map Issue tree Layered graph drawing Mind map Object-role
Truncated octahedron (1,887 words) [view diff] exact match in snippet view article find links to article
crystal Boleite crystal In the mathematical field of graph theory, a truncated octahedral graph is the graph of vertices and edges of the truncated octahedron
COVID-19 pandemic in Palau (1,006 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Domain of a function (962 words) [view diff] exact match in snippet view article find links to article
be graphed in the Cartesian coordinate system. In this case, the domain is represented on the x-axis of the graph, as the projection of the graph of the
COVID-19 pandemic in Guadeloupe (579 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Icosidodecahedron (1,362 words) [view diff] exact match in snippet view article find links to article
icosidodecahedron can be represented as the symmetric graph with 30 vertices and 60 edges, one of the Archimedean graphs. It is quartic, meaning that each of its vertex
Lot (department) (509 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Truncated tetrahedron (1,483 words) [view diff] exact match in snippet view article find links to article
World Cup. In the mathematical field of graph theory, a truncated tetrahedral graph is an Archimedean graph, the graph of vertices and edges of the truncated
Meurthe-et-Moselle (565 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Landes (department) (656 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
GTK Scene Graph Kit (1,152 words) [view diff] exact match in snippet view article find links to article
GTK Scene Graph Kit (GSK) is the rendering and scene graph API for GTK introduced with version 3.90. GSK lies between the graphical control elements (widgets)
Adjacency list (1,190 words) [view diff] exact match in snippet view article find links to article
In graph theory and computer science, an adjacency list is a collection of unordered lists used to represent a finite graph. Each unordered list within
Orne (461 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Landes (department) (656 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
GTK Scene Graph Kit (1,152 words) [view diff] exact match in snippet view article find links to article
GTK Scene Graph Kit (GSK) is the rendering and scene graph API for GTK introduced with version 3.90. GSK lies between the graphical control elements (widgets)
Gard (664 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 pandemic in Guinea (1,163 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Scale-free network (6,013 words) [view diff] exact match in snippet view article find links to article
transformation which converts random graphs to their edge-dual graphs (or line graphs) produces an ensemble of graphs with nearly the same degree distribution
Lot (department) (509 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Haute-Saône (748 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Savoie (1,210 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Graph automorphism (1,343 words) [view diff] exact match in snippet view article find links to article
In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving
Tetrahedron (9,506 words) [view diff] exact match in snippet view article find links to article
forms a graph, with 4 vertices, and 6 edges. It is a special case of the complete graph, K4, and wheel graph, W4. It is one of 5 Platonic graphs, each a
Function (mathematics) (11,411 words) [view diff] exact match in snippet view article
is uniquely represented by the set of all pairs (x, f (x)), called the graph of the function, a popular means of illustrating the function. When the
Percolation theory (3,133 words) [view diff] exact match in snippet view article find links to article
bottom? Similarly, one can ask, given a connected graph at what fraction 1 – p of failures the graph will become disconnected (no large component). The
Seven Bridges of Königsberg (1,789 words) [view diff] exact match in snippet view article find links to article
negative resolution by Leonhard Euler, in 1736, laid the foundations of graph theory and prefigured the idea of topology. The city of Königsberg in Prussia
COVID-19 pandemic in Lesotho (1,052 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Minhai COVID-19 vaccine (321 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Binary tree (5,064 words) [view diff] exact match in snippet view article find links to article
trees or the empty set and S is a singleton set containing the root. From a graph theory perspective, binary trees as defined here are arborescences. A binary
Characteristic polynomial (3,047 words) [view diff] exact match in snippet view article find links to article
characteristic polynomial to zero. In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency
Truncated tetrahedron (1,483 words) [view diff] exact match in snippet view article find links to article
World Cup. In the mathematical field of graph theory, a truncated tetrahedral graph is an Archimedean graph, the graph of vertices and edges of the truncated
La Paz Department (Bolivia) (470 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Edge coloring (8,472 words) [view diff] exact match in snippet view article find links to article
In graph theory, a proper edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color
Hertzsprung–Russell diagram (2,762 words) [view diff] exact match in snippet view article find links to article
indicator used in astronomy Color–color diagram – Astronomical diagram graphing two colour indices A.C. Maury; E.C. Pickering (1897). "Spectra of bright
Saône-et-Loire (614 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Puy-de-Dôme (569 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Differential calculus (4,452 words) [view diff] exact match in snippet view article find links to article
Geometrically, the derivative at a point is the slope of the tangent line to the graph of the function at that point, provided that the derivative exists and is
Loire (department) (434 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Cycle graph (518 words) [view diff] exact match in snippet view article find links to article
In 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
Resource Description Framework (5,086 words) [view diff] exact match in snippet view article find links to article
Resource Description Framework (RDF) is a method to describe and exchange graph data. It was originally designed as a data model for metadata by the World
Fredericton International Airport (574 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Babylon Governorate (462 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Microsoft Bing (9,449 words) [view diff] exact match in snippet view article find links to article
announced its knowledge and action API to correspond with Google's Knowledge graph with 1 billion instances and 20 billion related facts. The idea for a prediction
COVID-19 cases at the 2022 Winter Olympics and 2022 Winter Paralympics (718 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Terrebonne (federal electoral district) (674 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Hockey stick graph (global temperature) (18,586 words) [view diff] exact match in snippet view article
Hockey stick graphs present the global or hemispherical mean temperature record of the past 500 to 2000 years as shown by quantitative climate reconstructions
Loire-Atlantique (768 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
United States House of Representatives elections in the District of Columbia (1,866 words) [view diff] exact match in snippet view article find links to article
representative elections, the Democratic candidate ran unopposed. The following graph shows the margin of victory of the Democratic Party over the runner-up in
László Lovász (1,325 words) [view diff] exact match in snippet view article find links to article
the president of the Hungarian Academy of Sciences from 2014 to 2020. In graph theory, Lovász's notable contributions include the proofs of Kneser's conjecture
Seine-et-Marne (892 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Euclidean plane (1,967 words) [view diff] exact match in snippet view article find links to article
Such a drawing is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to
Dual graph (6,607 words) [view diff] exact match in snippet view article find links to article
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
Cut (graph theory) (1,132 words) [view diff] exact match in snippet view article
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
Borůvka's algorithm (1,176 words) [view diff] exact match in snippet view article find links to article
algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected. It was first published
Kakutani fixed-point theorem (3,237 words) [view diff] exact match in snippet view article find links to article
set-valued function on S with the following properties: φ has a closed graph; φ(x) is non-empty and convex for all x ∈ S. Then φ has a fixed point. Set-valued
Induced subgraph (509 words) [view diff] exact match in snippet view article find links to article
In graph theory, an induced subgraph of a graph is another graph, formed from a subset of the vertices of the graph and all of the edges, from the original
Exponential function (5,071 words) [view diff] exact match in snippet view article find links to article
algebras. The graph of y = e x {\displaystyle y=e^{x}} is upward-sloping, and increases faster than every power of ⁠ x {\displaystyle x} ⁠. The graph always
Cher (department) (456 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Transport network analysis (1,503 words) [view diff] exact match in snippet view article find links to article
A transport network, or transportation network, is a network or graph in geographic space, describing an infrastructure that permits and constrains movement
COVID-19 pandemic in the Marshall Islands (724 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Quadratic function (2,893 words) [view diff] exact match in snippet view article find links to article
polynomial are nearly synonymous and often abbreviated as quadratic. The graph of a real single-variable quadratic function is a parabola. If a quadratic
Cut (graph theory) (1,132 words) [view diff] exact match in snippet view article
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
Vaucluse (569 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Freebase (database) (1,238 words) [view diff] exact match in snippet view article
Google in a private sale announced on 16 July 2010. Google's Knowledge Graph is powered in part by Freebase. During its existence, Freebase data was
Diagram (1,045 words) [view diff] exact match in snippet view article find links to article
visualization which is then projected onto a two-dimensional surface. The word graph is sometimes used as a synonym for diagram. The term "diagram" in its commonly
Electoral district of Nanango (187 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Art Garfunkel (6,246 words) [view diff] no match in snippet view article find links to article
Arthur Ira Garfunkel (born November 5, 1941) is an American singer, actor and poet who is best known for his partnership with Paul Simon in the folk rock
Transport network analysis (1,503 words) [view diff] exact match in snippet view article find links to article
A transport network, or transportation network, is a network or graph in geographic space, describing an infrastructure that permits and constrains movement
COVID-19 pandemic in Chandigarh (2,656 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Exponential function (5,071 words) [view diff] exact match in snippet view article find links to article
algebras. The graph of y = e x {\displaystyle y=e^{x}} is upward-sloping, and increases faster than every power of ⁠ x {\displaystyle x} ⁠. The graph always
Haute-Marne (769 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Truncated cube (738 words) [view diff] exact match in snippet view article find links to article
truncated hypercubes: In the mathematical field of graph theory, a truncated cubical graph is the graph of vertices and edges of the truncated cube, one
Three utilities problem (2,758 words) [view diff] exact match in snippet view article find links to article
can be formalized as a problem in topological graph theory by asking whether the complete bipartite graph K 3 , 3 {\displaystyle K_{3,3}} , with vertices
Matu District (203 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Indre-et-Loire (558 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Stationary point (1,162 words) [view diff] exact match in snippet view article find links to article
stationary point of a differentiable function of one variable is a point on the graph of the function where the function's derivative is zero. Informally, it
2022 Iowa Attorney General election (335 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
United States House of Representatives elections in the District of Columbia (1,866 words) [view diff] exact match in snippet view article find links to article
representative elections, the Democratic candidate ran unopposed. The following graph shows the margin of victory of the Democratic Party over the runner-up in
Statistics of the COVID-19 pandemic in Singapore (2,926 words) [view diff] exact match in snippet view article find links to article
the graph plotted on a logarithmic scale, or a semi-log plot, shows an exponential growth in the number of cases as a straight line on the graph. In the
Knot (mathematics) (2,509 words) [view diff] exact match in snippet view article
mathematics that studies knots is known as knot theory and has many relations to graph theory. A knot is an embedding of the circle (S1) into three-dimensional
COVID-19 pandemic in the Central African Republic (1,174 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Induced subgraph (509 words) [view diff] exact match in snippet view article find links to article
In graph theory, an induced subgraph of a graph is another graph, formed from a subset of the vertices of the graph and all of the edges, from the original
Elections in Northern Ireland (410 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Loop (graph theory) (390 words) [view diff] exact match in snippet view article
In graph theory, a loop (also called a self-loop or a buckle) is an edge that connects a vertex to itself. A simple graph contains no loops. Depending
Data Commons (934 words) [view diff] exact match in snippet view article find links to article
open-source platform created by Google that provides an open knowledge graph, combining economic, scientific and other public datasets into a unified
Facebook Graph Search (2,159 words) [view diff] exact match in snippet view article find links to article
Facebook Graph Search was a semantic search engine that Facebook introduced in March 2013. It was designed to give answers to user natural language queries
Quadratic function (2,893 words) [view diff] exact match in snippet view article find links to article
polynomial are nearly synonymous and often abbreviated as quadratic. The graph of a real single-variable quadratic function is a parabola. If a quadratic
Dordogne (1,666 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Kabong District (107 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Mathematical chemistry (610 words) [view diff] exact match in snippet view article find links to article
chemistry. Major areas of research in mathematical chemistry include chemical graph theory, which deals with topology such as the mathematical study of isomerism
Second derivative (2,013 words) [view diff] exact match in snippet view article find links to article
respect to time. On the graph of a function, the second derivative corresponds to the curvature or concavity of the graph. The graph of a function with a
Robert Tarjan (1,513 words) [view diff] exact match in snippet view article find links to article
American computer scientist and mathematician. He is the discoverer of several graph theory algorithms, including his strongly connected components algorithm
Val-de-Marne (408 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 pandemic in Vanuatu (1,799 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
List of Quebec general elections (595 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Pantograph (1,944 words) [view diff] exact match in snippet view article find links to article
A pantograph (from Greek παντ- 'all, every' and γραφ- 'to write', from their original use for copying writing) is a mechanical linkage connected in a manner
COVID-19 vaccination in Botswana (1,486 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Papineau (electoral district) (795 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Electoral district of Rockhampton (213 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
K-vertex-connected graph (772 words) [view diff] exact match in snippet view article find links to article
In graph theory, a connected graph G is said to be k-vertex-connected (or k-connected) if it has more than k vertices and remains connected whenever fewer
Stem-and-leaf display (1,090 words) [view diff] exact match in snippet view article find links to article
A stem-and-leaf display or stem-and-leaf plot is a device for presenting quantitative data in a graphical format, similar to a histogram, to assist in
Inflection point (1,219 words) [view diff] exact match in snippet view article find links to article
at which the curvature changes sign. In particular, in the case of the graph of a function, it is a point where the function changes from being concave
Dense graph (1,252 words) [view diff] exact match in snippet view article find links to article
In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges (where every pair of vertices is connected
Albertville (601 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Yvelines (1,003 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Béla Bollobás (1,674 words) [view diff] exact match in snippet view article find links to article
various areas of mathematics, including functional analysis, combinatorics, graph theory, and percolation. He was strongly influenced by Paul Erdős from the
Settimo Rottaro (582 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
List of graphs by edges and vertices (85 words) [view diff] exact match in snippet view article find links to article
various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)
COVID-19 pandemic in the Solomon Islands (999 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Chordal graph (2,164 words) [view diff] exact match in snippet view article find links to article
In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not
Essonne (821 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Neuilly-sur-Seine (2,351 words) [view diff] exact match in snippet view article find links to article
election. Logo until 2022 Logo since 2022 The population data in the table and graph below refer to the commune of Neuilly-sur-Seine proper, in its geography
COVID-19 vaccination in Iceland (1,636 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Complement graph (1,125 words) [view diff] exact match in snippet view article find links to article
In 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 of
COVID-19 pandemic in Liberia (2,004 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Tarn (department) (845 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 vaccination in Spain (1,005 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Closed graph property (2,989 words) [view diff] exact match in snippet view article find links to article
topology, closed graph is a property of functions. A function f : X → Y between topological spaces has a closed graph if its graph is a closed subset
Onga, Hungary (218 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Facebook Graph Search (2,159 words) [view diff] exact match in snippet view article find links to article
Facebook Graph Search was a semantic search engine that Facebook introduced in March 2013. It was designed to give answers to user natural language queries
Petersen graph (2,993 words) [view diff] exact match in snippet view article find links to article
bridgeless graph has a cycle-continuous mapping to the Petersen graph. More unsolved problems in mathematics In the mathematical field of graph theory, the
Haute-Corse (440 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Essonne (821 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Ille-et-Vilaine (1,085 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
1936 Republican Party presidential primaries (387 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Truncated icosidodecahedron (850 words) [view diff] exact match in snippet view article find links to article
the mathematical field of graph theory, a truncated icosidodecahedral graph (or great rhombicosidodecahedral graph) is the graph of vertices and edges of
Saratok District (108 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Algoma—Manitoulin—Kapuskasing (942 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Nièvre (880 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
United States presidential elections in Iowa (256 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Indre (1,278 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Dibrugarh Airport (261 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
MATLAB (3,033 words) [view diff] exact match in snippet view article find links to article
MATLAB has tightly integrated graph-plotting features. For example, the function plot can be used to produce a graph from two vectors x and y. The code:
Hérault (1,432 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Vincennes (979 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Selangau District (89 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Integer partition (3,405 words) [view diff] exact match in snippet view article find links to article
diagram of a typical large partition becomes asymptotically close to the graph of a certain analytic function minimizing a certain functional. In 1988
Jorhat Airport (283 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Hautes-Pyrénées (713 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Pekan District (184 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Central Thailand (702 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Côtes-d'Armor (744 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Yonne (1,262 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Haut-Rhin (781 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
HomoloGene (340 words) [view diff] exact match in snippet view article find links to article
globally, rather than locally, in a bipartite matching (see complete bipartite graph). And then it calculates the statistical significance of each match. Cutoffs
Isère (996 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Network theory (3,952 words) [view diff] exact match in snippet view article find links to article
science and network science, network theory is a part of graph theory. It defines networks as graphs where the vertices or edges possess attributes. Network
Network science (9,906 words) [view diff] exact match in snippet view article find links to article
foundation of graph theory, a branch of mathematics that studies the properties of pairwise relations in a network structure. The field of graph theory continued
Colombes (878 words) [view diff] exact match in snippet view article find links to article
size of its territory before 1896. The population data in the table and graph below refer to the commune of Colombes proper, in its geography at the given
United States Senate elections in the District of Columbia (556 words) [view diff] exact match in snippet view article find links to article
candidate, with no margin less than 58 percentage points. The following graph shows the margin of victory of the Democratic Party over the runner-up in
Charente (758 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Snub cube (976 words) [view diff] exact match in snippet view article find links to article
skeleton of a snub cube can be represented as a graph with 24 vertices and 60 edges, an Archimedean graph. Conway, John H.; Burgiel, Heidi; Goodman-Struss
University—Rosedale (federal electoral district) (463 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Truncated dodecahedron (810 words) [view diff] exact match in snippet view article find links to article
its mirror image. In the mathematical field of graph theory, a truncated dodecahedral graph is the graph of vertices and edges of the truncated dodecahedron
Complex network (2,448 words) [view diff] exact match in snippet view article find links to article
network is a graph (network) with non-trivial topological features—features that do not occur in simple networks such as lattices or random graphs but often
Electoral district of Keppel (129 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
List of Ontario general elections (339 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 pandemic in Laos (1,251 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Saint-Malo (2,540 words) [view diff] exact match in snippet view article find links to article
Saint-Malo are called Malouins in French. The population data in the table and graph below refer to the commune of Saint-Malo proper in its geography for the
COVID-19 vaccination in Nigeria (1,140 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
NP-completeness (3,617 words) [view diff] exact match in snippet view article find links to article
example is the graph isomorphism problem, the graph theory problem of determining whether a graph isomorphism exists between two graphs. Two graphs are isomorphic
Concept map (1,470 words) [view diff] exact match in snippet view article find links to article
formalism. Topic maps: Both concept maps and topic maps are kinds of knowledge graph, but topic maps were developed by information management professionals for
Freyming-Merlebach (98 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Parse tree (1,359 words) [view diff] no match in snippet view article find links to article
A parse tree or parsing tree (also known as a derivation tree or concrete syntax tree) is an ordered, rooted tree that represents the syntactic structure
5-demicube (670 words) [view diff] exact match in snippet view article find links to article
polytopes: 221, 321, and 421. The graph formed by the vertices and edges of the demipenteract is sometimes called the Clebsch graph, though that name sometimes
Actors' Equity Association (2,256 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Erdős number (3,624 words) [view diff] exact match in snippet view article find links to article
researchers, using the Erdős number as a proxy. For example, Erdős collaboration graphs can tell us how authors cluster, how the number of co-authors per paper
Calvados (department) (1,153 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 pandemic in Andhra Pradesh (1,394 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Rhône (department) (569 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Snub cube (976 words) [view diff] exact match in snippet view article find links to article
skeleton of a snub cube can be represented as a graph with 24 vertices and 60 edges, an Archimedean graph. Conway, John H.; Burgiel, Heidi; Goodman-Struss
Hassler Whitney (2,608 words) [view diff] exact match in snippet view article find links to article
Whitney's earliest work, from 1930 to 1933, was on graph theory. Many of his contributions were to the graph-coloring, and the ultimate computer-assisted solution
List of graphs by edges and vertices (85 words) [view diff] exact match in snippet view article find links to article
various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)
Chordal graph (2,164 words) [view diff] exact match in snippet view article find links to article
In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not
Loiret (1,249 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Saint-Malo (2,540 words) [view diff] exact match in snippet view article find links to article
Saint-Malo are called Malouins in French. The population data in the table and graph below refer to the commune of Saint-Malo proper in its geography for the
Lattice graph (547 words) [view diff] exact match in snippet view article find links to article
In graph theory, a lattice graph, mesh graph, or grid graph is a graph whose drawing, embedded in some Euclidean space ⁠ R n {\displaystyle \mathbb {R}
Apache Giraph (144 words) [view diff] exact match in snippet view article find links to article
Apache project to perform graph processing on big data. Giraph utilizes Apache Hadoop's MapReduce implementation to process graphs. Facebook used Giraph with
COVID-19 pandemic in Haryana (2,679 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Muthanna Governorate (240 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Chatou (510 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Electoral district of Pumicestone (148 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Erik Nielsen Whitehorse International Airport (1,697 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Degree matrix (375 words) [view diff] exact match in snippet view article find links to article
In the mathematical field of algebraic graph theory, the degree matrix of an undirected graph is a diagonal matrix which contains information about the
Indre (1,278 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Sartrouville (407 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Cugnaux (99 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Simon & Garfunkel (8,250 words) [view diff] exact match in snippet view article find links to article
and Garfunkel assumed the name Tom & Jerry; Garfunkel named himself Tom Graph, a reference to his interest in mathematics, and Simon Jerry Landis, after
NP-completeness (3,617 words) [view diff] exact match in snippet view article find links to article
example is the graph isomorphism problem, the graph theory problem of determining whether a graph isomorphism exists between two graphs. Two graphs are isomorphic
COVID-19 pandemic in Niger (2,029 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 vaccination in Nigeria (1,140 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Talant (74 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Truncated icosidodecahedron (850 words) [view diff] exact match in snippet view article find links to article
the mathematical field of graph theory, a truncated icosidodecahedral graph (or great rhombicosidodecahedral graph) is the graph of vertices and edges of
Saint-Cloud (1,231 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Compiègne (1,186 words) [view diff] exact match in snippet view article find links to article
with 141,504 inhabitants as of 2017. The population data in the table and graph below refer to the commune of Compiègne proper. The Hôtel de Ville (town
JB Hi-Fi (1,189 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Yonne (1,262 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Neuville-en-Ferrain (90 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Doubs (857 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Deterministic acyclic finite state automaton (972 words) [view diff] exact match in snippet view article find links to article
form of a directed acyclic graph with a single source vertex (a vertex with no incoming edges), in which each edge of the graph is labeled by a letter or
Eure-et-Loir (1,295 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Brome—Missisquoi (federal electoral district) (551 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Jorhat Airport (283 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Lys-lez-Lannoy (99 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Semi-log plot (1,133 words) [view diff] exact match in snippet view article find links to article
In science and engineering, a semi-log plot/graph or semi-logarithmic plot/graph has one axis on a logarithmic scale, the other on a linear scale. It is
COVID-19 pandemic in Antigua and Barbuda (1,290 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Corse-du-Sud (547 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Abscon (89 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Castelginest (97 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Florange (128 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Light curve (1,515 words) [view diff] exact match in snippet view article find links to article
In astronomy, a light curve is a graph of the light intensity of a celestial object or region as a function of time, typically with the magnitude of light
Electoral district of Pumicestone (148 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Villeneuve-Tolosane (90 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 pandemic in Djibouti (1,888 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 vaccination in South Korea (1,409 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Northern Thailand (1,117 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Olympic Dam Airport (514 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Cugnaux (99 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
United States presidential elections in Alaska (1,138 words) [view diff] exact match in snippet view article find links to article
state in recent political history, from 1968 to present. The following graph shows the margin of victory of the winner over the runner-up in the 16 presidential
Lens, Pas-de-Calais (683 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Chatou (510 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Matroid (8,774 words) [view diff] exact match in snippet view article find links to article
theory borrows extensively from the terms used in both linear algebra and graph theory, largely because it is the abstraction of various notions of central
COVID-19 pandemic in Antigua and Barbuda (1,290 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Electoral district of Southern Downs (255 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Longwy (611 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Spectral graph theory (1,844 words) [view diff] exact match in snippet view article find links to article
In mathematics, spectral graph theory is the study of the properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors
Eure-et-Loir (1,295 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Degree matrix (375 words) [view diff] exact match in snippet view article find links to article
In the mathematical field of algebraic graph theory, the degree matrix of an undirected graph is a diagonal matrix which contains information about the
Candlestick chart (1,013 words) [view diff] no match in snippet view article find links to article
A candlestick chart (also called Japanese candlestick chart or K-line) is a style of financial chart used to describe price movements of a security, derivative
Paraburdoo Airport (416 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Pontault-Combault (220 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Hambach, Moselle (162 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 pandemic in Kiribati (1,700 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
University—Rosedale (federal electoral district) (463 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Betti number (2,490 words) [view diff] exact match in snippet view article find links to article
topological graph G in which the set of vertices is V, the set of edges is E, and the set of connected components is C. As explained in the page on graph homology
Castelginest (97 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Hautes-Alpes (746 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Sputnik Light (1,038 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Harghita County (784 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Ronchin (85 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
State diagram (1,958 words) [view diff] exact match in snippet view article find links to article
classic form of state diagram for a finite automaton (FA) is a directed graph with the following elements (Q, Σ, Z, δ, q0, F): Vertices Q: a finite set
Bondy (614 words) [view diff] exact match in snippet view article find links to article
which has its own elementary school. The population data in the table and graph below refer to the commune of Bondy proper, in its geography at the given
Frank Harary (2,483 words) [view diff] exact match in snippet view article find links to article
American mathematician, who specialized in graph theory. He was widely recognized as one of the "fathers" of modern graph theory. Harary was a master of clear
Corbeil-Essonnes (944 words) [view diff] exact match in snippet view article find links to article
known as Corbeil-Essonnois. The population data given in the table and graph below for 1946 and earlier refer to the former commune of Corbeil. In the
Klang, Moselle (109 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Council on Tall Buildings and Urban Habitat (1,512 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Siersthal (150 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Transport Canada (2,839 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 pandemic in Puducherry (2,620 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Asajaya District (541 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Mayenne (1,279 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Woippy (99 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Houilles (317 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Triaugmented triangular prism (2,224 words) [view diff] exact match in snippet view article find links to article
triaugmented triangular prism form a maximal planar graph with 9 vertices and 21 edges, called the Fritsch graph. It was used by Rudolf and Gerda Fritsch to show
Riupeyrous (84 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Distance matrix (4,098 words) [view diff] exact match in snippet view article find links to article
In mathematics, computer science and especially graph theory, a distance matrix is a square matrix (two-dimensional array) containing the distances, taken
Daro District (296 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Jeumont (241 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Kelowna International Airport (1,533 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Ham, Somme (452 words) [view diff] exact match in snippet view article find links to article
1965 and 1966 respectively. The population data given in the table and graph below for 1962 and earlier refer to the commune of Ham excluding Estouilly
Domino tiling (1,509 words) [view diff] exact match in snippet view article find links to article
meeting edge-to-edge. Equivalently, it is a perfect matching in the grid graph formed by placing a vertex at the center of each square of the region and
Riupeyrous (84 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Villers-sous-Chalamont (88 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Daro District (296 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Path graph (289 words) [view diff] exact match in snippet view article find links to article
In the mathematical field of graph theory, a path graph (or linear graph) is a graph whose vertices can be listed in the order v1, v2, ..., vn such that
Taverny (338 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
AVE (1,081 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Jeumont (241 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Kelowna International Airport (1,533 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 vaccination in Peru (3,554 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Longuenesse (104 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Lons (82 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Ham, Somme (452 words) [view diff] exact match in snippet view article find links to article
1965 and 1966 respectively. The population data given in the table and graph below for 1962 and earlier refer to the commune of Ham excluding Estouilly
Pantelleria Airport (237 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Domino tiling (1,509 words) [view diff] exact match in snippet view article find links to article
meeting edge-to-edge. Equivalently, it is a perfect matching in the grid graph formed by placing a vertex at the center of each square of the region and
Conceptual graph (763 words) [view diff] exact match in snippet view article find links to article
A conceptual graph (CG) is a formalism for knowledge representation. In the first published paper on CGs, John F. Sowa used them to represent the conceptual
Mayenne (1,279 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Larnod (124 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Basra Governorate (676 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Haubourdin (84 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Montigny-en-Gohelle (120 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
London—Fanshawe (federal electoral district) (678 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Élancourt (368 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Truncated cuboctahedron (977 words) [view diff] exact match in snippet view article find links to article
In the mathematical field of graph theory, a truncated cuboctahedral graph (or great rhombcuboctahedral graph) is the graph of vertices and edges of the
Democratic Party of the Left (1,320 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Woippy (99 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Log–log plot (2,704 words) [view diff] exact match in snippet view article find links to article
In science and engineering, a log–log graph or log–log plot is a two-dimensional graph of numerical data that uses logarithmic scales on both the horizontal
Mios (150 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Transport Canada (2,839 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Ramsey's theorem (8,534 words) [view diff] exact match in snippet view article find links to article
its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling (with colours) of a sufficiently large complete graph. To
Ottrott (316 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Poissy (790 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Tournefeuille (163 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Marly, Nord (86 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Sendai 89ers (159 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
1944 Republican Party presidential primaries (861 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Madurai Airport (1,767 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Polynomial (8,173 words) [view diff] exact match in snippet view article find links to article
real variable can be represented by a graph. The graph of the zero polynomial f(x) = 0 is the x-axis. The graph of a degree 0 polynomial f(x) = a0, where
Montigny-lès-Metz (156 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Bidar Airport (201 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Wasit Governorate (349 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Houilles (317 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Saint-Jean, Haute-Garonne (154 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Feynman diagram (15,967 words) [view diff] exact match in snippet view article find links to article
device of covariant perturbation theory, the graphs were called Feynman–Dyson diagrams or Dyson graphs, because the path integral was unfamiliar when
Bau District, Sarawak (647 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Saint-Saulve (120 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
SPQR tree (1,853 words) [view diff] exact match in snippet view article find links to article
In graph theory, a branch of mathematics, the triconnected components of a biconnected graph are a system of smaller graphs that describe all of the 2-vertex
Rexpoëde (92 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Triaugmented triangular prism (2,224 words) [view diff] exact match in snippet view article find links to article
triaugmented triangular prism form a maximal planar graph with 9 vertices and 21 edges, called the Fritsch graph. It was used by Rudolf and Gerda Fritsch to show
Valentigney (142 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
South Gyeongsang Province (1,173 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Valentigney (142 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Élancourt (368 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Toronto Centre (federal electoral district) (1,348 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Rexpoëde (92 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Electoral district of Benambra (255 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Semantic Scholar (1,387 words) [view diff] exact match in snippet view article find links to article
Semantic Scholar also exploits graph structures, which include the Microsoft Academic Knowledge Graph, Springer Nature's SciGraph, and the Semantic Scholar
Register allocation (5,066 words) [view diff] exact match in snippet view article find links to article
register allocation), or across function boundaries traversed via call-graph (interprocedural register allocation). When done per function/procedure
South Gyeongsang Province (1,173 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Rombas (329 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Ramonville-Saint-Agne (139 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Fort-de-France (953 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Nineveh Governorate (1,158 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Voronoi diagram (5,504 words) [view diff] exact match in snippet view article find links to article
metrics. Voronoi diagrams of 20 points under two different metrics The dual graph for a Voronoi diagram (in the case of a Euclidean space with point sites)
Algonquin—Renfrew—Pembroke (860 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Madurai Airport (1,767 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Electoral district of Prahran (668 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Le Chesnay-Rocquencourt (150 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Tinqueux (113 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Bellechasse—Les Etchemins—Lévis (395 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Castanet-Tolosan (95 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
1949 Australian federal election (668 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Marly, Nord (86 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Biganos (96 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Yerres (373 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Ramsey's theorem (8,534 words) [view diff] exact match in snippet view article find links to article
its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling (with colours) of a sufficiently large complete graph. To
Vendée (1,896 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Seine-Saint-Denis (1,036 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Laxou (97 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Bau District, Sarawak (647 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Lenoncourt (243 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
SPQR tree (1,853 words) [view diff] exact match in snippet view article find links to article
In graph theory, a branch of mathematics, the triconnected components of a biconnected graph are a system of smaller graphs that describe all of the 2-vertex
Blagnac (581 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Google Friend Connect (1,266 words) [view diff] exact match in snippet view article find links to article
could use their existing profile and access a social graph when posting messages, the social graph feature allowed a user to post a message on a third-party
Bruges, Gironde (139 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Markham—Thornhill (federal electoral district) (456 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Suresnes (1,028 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Potosí Department (552 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Drôme (1,235 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Ford–Fulkerson algorithm (2,300 words) [view diff] exact match in snippet view article find links to article
an "algorithm" as the approach to finding augmenting paths in a residual graph is not fully specified or it is specified in several implementations with
Villerupt (140 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Jamnagar Airport (375 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Les Mureaux (229 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Pierre, South Dakota (2,251 words) [view diff] exact match in snippet view article find links to article
on February 9, 1994, to 117 °F (47 °C) on July 15, 2006. See or edit raw graph data. Pierre is the principal city of the Pierre micropolitan area, which
Frouzins (103 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
COVID-19 pandemic in Liechtenstein (1,016 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Oruro Department (513 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Ancourt (135 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Microsoft Office shared tools (3,036 words) [view diff] exact match in snippet view article find links to article
Access to create charts and graphs. The program is available as an OLE application object in Visual Basic. Microsoft Graph supports many different types
Taxation in Iceland (543 words) [view diff] exact match in snippet view article find links to article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found
Haldimand—Norfolk (federal electoral district) (747 words) [view diff] exact match in snippet view article
Graphs are unavailable due to technical issues. Updates on reimplementing the Graph extension, which will be known as the Chart extension, can be found