Find link

Find link is a tool written by Edward Betts.

searching for Supergraph 15 found (18 total)

alternate case: supergraph

Connected component (graph theory) (873 words) [view diff] exact match in snippet view article

other by paths, and which is connected to no additional vertices in the supergraph. For example, the graph shown in the illustration on the right has three
Epigraph (mathematics) (324 words) [view diff] exact match in snippet view article
In mathematics, the epigraph or supergraph of a function f : Rn→R is the set of points lying on or above its graph:
Graph sandwich problem (522 words) [view diff] exact match in snippet view article find links to article
graphs, one of which must be a subgraph and the other of which must be a supergraph of the desired graph. Graph sandwich problems generalize the problem of
Graph bandwidth (1,310 words) [view diff] exact match in snippet view article find links to article
defined as one less than the maximum clique size in a proper interval supergraph of the given graph, chosen to minimize its clique size (Kaplan & Shamir
Tree-depth (2,433 words) [view diff] exact match in snippet view article find links to article
numerical invariant of G, the minimum height of a Trémaux tree for a supergraph of G. This invariant and its close relatives have gone under many different
Glossary of graph theory (13,217 words) [view diff] exact match in snippet view article find links to article
completion of a given graph is a supergraph that has some desired property. For instance, a chordal completion is a supergraph that is a chordal graph. 3.  A
Semi-Yao graph (311 words) [view diff] exact match in snippet view article find links to article
{\displaystyle \theta } and an appropriate cone axis, the k-SYG gives a supergraph of the k-nearest neighbor graph (k-NNG). For example, in 2D, if we partition
Clebsch graph (1,052 words) [view diff] exact match in snippet view article find links to article
and every four-chromatic induced subgraph of the Clebsch graph is a supergraph of the Grötzsch graph. More strongly, every triangle-free four-chromatic
Pathwidth (7,482 words) [view diff] exact match in snippet view article find links to article
interval thickness (one less than the maximum clique size in an interval supergraph of G), vertex separation number, or node searching number. Pathwidth and
Interval graph (2,007 words) [view diff] exact match in snippet view article find links to article
subgraph. The parameterized version of interval completion (find an interval supergraph with k additional edges) is fixed parameter tractable, and moreover, is
Aanderaa–Karp–Rosenberg conjecture (3,074 words) [view diff] exact match in snippet view article find links to article
every supergraph of this graph on the same vertex set also possesses it. For instance, the property of being nonplanar is monotone: a supergraph of a nonplanar
PC Engine SuperGrafx (1,732 words) [view diff] case mismatch in snippet view article find links to article
(PI-PD7) - An unreleased cockpit-sized controller that attaches onto the SuperGraph unit itself, connecting via the expansion port on the front side. The
De Bruijn–Erdős theorem (graph theory) (2,579 words) [view diff] exact match in snippet view article
then there is a k-coloring of G in which each finite graph has a larger supergraph whose coloring agrees with the coloring of the whole graph. If a graph
Kinetic closest pair (1,037 words) [view diff] exact match in snippet view article find links to article
Delaunay triangulations, so called Equilateral Delaunay graph (EDG), is a supergraph for the nearest neighbor graph (NNG); the endpoints of the edge with minimum
Clique problem (8,529 words) [view diff] exact match in snippet view article find links to article
graph property (if a clique exists in a given graph, it will exist in any supergraph) there must exist a monotone circuit, using only and gates and or gates