searching for Supergraph 12 found (17 total)

alternate case: supergraph

Connected component (graph theory)
(872 words)
[view diff]
exact match in snippet
view article
find links to 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 threeEpigraph (mathematics) (218 words) [view diff] exact match in snippet view article find links to article

In mathematics, the epigraph or supergraph of a function f : Rn→R is the set of points lying on or above its graph: The strict epigraph is the epigraphGraph 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 ofGraph bandwidth (1,021 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 & ShamirClebsch graph (960 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-chromaticTree-depth (2,218 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 differentGlossary of graph theory (6,948 words) [view diff] exact match in snippet view article find links to article

of G, and whose edges are a subset of the edge set of G. In reverse, a supergraph of a graph G is a graph of which G is a subgraph. A graph, G, containsPathwidth (7,461 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 andSemi-Yao graph (283 words) [view diff] exact match in snippet view article find links to article

triangulations. For a small 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 partitionDe Bruijn–Erdős theorem (graph theory) (2,575 words) [view diff] exact match in snippet view article find links to 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 graphKinetic closest pair (1,030 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 minimumClique problem (7,696 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