Sentence examples for graphs are characterized from inspiring English sources

Several divisible design graphs are characterized in terms of the parameters.

In particular, we give lower bounds on (rho+partial_{1}), (rho-partial_{n}), (rho+partial_{1}^{L}), (partial_{1}^{L}-rho), (2rho+partial _{1}^{Q}) and (partial_{1}^{Q}-2rho) and the corresponding extremal graphs are characterized.

Meanwhile, models that are equally well represented by both grid and spur graphs are characterized by |K j | = |K d |, which, in Fig. 3, is all of the graphs except I, J, M, N, R and S.

They also gave lower bounds on (rho+partial_{n}) and (partial_{1}-rho) when (Gncong K_{n}) and the extremal graphs were characterized.

In this model, nodes of the graph are characterized by Gabor jets, that is, Gabor wavelet responses at several scales and orientations, all stacked as a vector.

The between-class similarity graph is characterized by Wb,ij = S b (i, j).

The graph is characterized by a weighted adjacency matrix W = [wkl], k,l = 1.p, and the diagonal degree matrix D with degrees d1 to dp as diagonal elements.

The rPIN network graph is characterized by a relatively short characteristic length (CL) of 3.49 ± 0.01.

We applied the ClusterONE algorithm that detects overlapping protein complexes in weighted networks by searching for sub-graphs that are characterized by many reliable interactions between proteins and separation from the remaining network [ 28].

Watts and Strogatz (1998) showed that ordered graphs (lattices, regular networks) are characterized by high CC and long L. Random graphs, i.e., with all connections randomly reshuffled between the nodes, have short L but low CC.

We say that (vec{G}) is an orientation of G. Mixed graphs having Eulerian orientations are characterized as follows.