searching for Supergraph 16 found (21 total)

alternate case: supergraph

Glossary of graph theory
(7,386 words)
[view diff]
exact match in snippet
view article
find links to article

In the other direction, a supergraph of a graph G is a graph of which G is a subgraph. We say a graph G contains another graph H if somePathwidth (8,582 words) [view diff] exact match in snippet view article find links to article...

Pathwidth is also known as interval thickness (one less than the maximum clique size in an interval supergraph of G), vertex separationTree-depth (2,559 words) [view diff] exact match in snippet view article find links to article...

the minimum height of a Trémaux tree for a supergraph of G. This invariant and its close relatives have gone under many different namesConnected component (graph theory) (916 words) [view diff] exact match in snippet view article find links to article...

subgraph in which any two vertices are connected to each other by paths , and which is connected to no additional vertices in the supergraph.Supersymmetry nonrenormalization theorems (1,142 words) [view diff] exact match in snippet view article find links to article...

j NUPHA,B159,429 Improved methods for supergraphs. Nonrenormalization in supersymmetric theories and holomorphy : Nonrenormalization theoremsGraph sandwich problem (640 words) [view diff] exact match in snippet view article find links to article...

and is "sandwiched" between two other graphs, one of which must be a subgraph and the other of which must be a supergraph of the desired graph.Graph bandwidth (1,152 words) [view diff] exact match in snippet view article find links to article...

The bandwidth may also be defined as one less than the maximum clique size in a proper interval supergraph of the given graph, chosen toSim (pencil game) (626 words) [view diff] no match in snippet view article find links to article...

This will also apply to any super-graph of K 6. For another proof that there must eventually be a triangle of either color, see theWarren Siegel (697 words) [view diff] exact match in snippet view article find links to article...

theorem was introduced by Grisaru, Siegel and Rocek in their 1979 paper "Improved methods for supergraphs", which has close to 700 citationsClebsch graph (1,176 words) [view diff] exact match in snippet view article find links to article...

smallest triangle-free four-chromatic graph, and every four-chromatic induced subgraph of the Clebsch graph is a supergraph of the Grötzsch graph.Network motif (12,032 words) [view diff] exact match in snippet view article find links to article...

Here is the main idea: by a simple criterion one can generalize a mapping of a k-size graph into the network to its same size supergraphs.Nested triangles graph (853 words) [view diff] exact match in snippet view article find links to article...

svg | 2008 but unlike theirs does not generalize to maximal planar supergraphs of the nested triangles graph. The nested triangles graph wasConvex set (1,416 words) [view diff] exact match in snippet view article find links to article...

In vector spaces: File:Convex supergraph. png | A function is convex if and only if its epigraph , the region (in green) above its graph (inHereditary property (1,270 words) [view diff] exact match in snippet view article find links to article...

In graph theory: the property should hold for all supergraphs. Preserved by the addition of edges (This meaning is used in the statement of theDe Bruijn–Erdős theorem (graph theory) (2,755 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 graphClique problem (9,254 words) [view diff] exact match in snippet view article find links to article...

(if a clique exists in a given graph, it will exist in any supergraph) there must exist a monotone circuit, using only and gate s and or...