Sentence examples for certain graphs from inspiring English sources

The proof is based on estimates of chromatic numbers of certain graphs on Zn.

Certain graphs from among those in G v,δ) with maximum girth have a special property called trace-minimality.

For certain graphs, various found proofs will share common subsets, which are simulated redundantly.

Ramsey's theorem is a result in infinitary combinatorics, established by Frank Ramsey (1930), and deals with possibilities of "colouring" for certain graphs.

In this section we study exact computations of t i n f e =t i n f e (k)= maxi∈{1,…,k}t m e e t (i) for certain graphs.

They can be presented as certain graphs or as lists of reactions over a set of species.

We introduce a simple method for proving lower bounds for the size of the smallest percolating set in a certain graph bootstrap process.

The contributions of this work include the development of minimal qualitative circuit models and simulation algorithms, an understanding of their relationship to certain graph-theoretic properties of circuits and the relevance of such models for fault modelling in FMEA tasks.

In this paper we prove that under certain conditions, the final clusters obtained by the algorithm are nothing but the connected components of a certain graph with the input data-points as vertices.

In this paper, we establish the existence of fixed points for set-valued mappings satisfying certain graph contractions with set-valued domain endowed with a graph.

In this section, we obtain several fixed point results for set-valued selfmaps on (CB X)) satisfying certain graph contraction conditions.