Sentence examples for the graphs for which from inspiring English sources

Also, we determine the graphs for which the lower bound is sharp.

where 's are some numbers (for ) which somehow can be computed from the graph, for which we only need to know that they satisfy the conditions (2.20).

Then the task of identifying coherent gene subsets is reduced to the task of finding highly connected subgraphs from the graph, for which different existing graph-cut algorithms can be employed.

Unlike the average Lefschetz number L ( G ), which is also an isomorphism invariant, the zeta function encodes more information about the graph than G / A. Figures 1-6 providexampleses of graphs for which the Zeta function and the Lefschetz number have been computed for all automorphisms.

Hence, the problem of determining all complete mixed graphs for which the lower bound in Theorem 3.8 is attained appears to be somewhat more difficult.

There are graphs for which the Grundy index equals the maximum degree, stars for example.

The algorithm improves a result found for general max-tolerance graphs, for which the computation of all maximal cliques has a runtime of O(n) [ 9].

We describe a wide class of graphs for which the Ádám conjecture holds.

Furthermore, to illustrate the usefulness of our new drawing method for graphs with zero-sized nodes, we give an application to the visualization of hierarchical clustered graphs, for which our method offers a very efficient solution.

We develop efficient compressive sensing algorithms based on expander graphs for which the number of measurements is optimal.

Figure 2 Two examples of graphs for which the cyclomatic complexities have been calculated.