Examples of using Adjacency in English and their translations into Russian
{-}
-
Official
-
Colloquial
as an individual nation, survived while the Mongols exterminated many other peoples who had lived in the adjacency, suggests that special relations existed between the conquerors
and an edge for every adjacency between a pair of faces.
ignoring adjacencies in the graph.
Note that a high power β{\displaystyle\beta} transforms high similarities into high adjacencies, while pushing low similarities towards 0.
Since the partition classes are disjoint, their adjacencies constitute a new graph,
That is, each vertex of G/ P{\displaystyle G/P} is a module of G, and the adjacencies of these modules are the edges of G/ P{\displaystyle G/P.
The set of antipodal pairs of vertices and their adjacencies can itself be viewed as a graph,
In the figure, the adjacencies between regions of this map form the Errera graph,
graph means reversing the adjacencies of each pair of vertices,
with no self-loops or multiple adjacencies.
Adjacent" would include trans-ocean adjacency, e.g. Brazil and Nigeria.
Many graph problems are solved in the setting where the adjacency matrix or the adjacency list of the graph is streamed in some unknown order.
In the matrix theory of graphs the rank r of an undirected graph is defined as the rank of its adjacency matrix.
For directed graphs, one considers the singular values of the adjacency matrix A, which are equal to the roots of the eigenvalues of the symmetric matrix ATA.
eigenvectors of matrices associated with the graph, such as its adjacency matrix or Laplacian matrix.
for two P nodes to be adjacent, because if such an adjacency occurred the two nodes could be merged into a single larger node.
Strained adjacency of discreet olive colors with understatement of unstained white canvas,
-1, 1)-adjacency matrix or Seidel adjacency matrix of G. The Seidel matrix has zero entries on the main diagonal,
over all hierarchical partitions of the vertices of the graph, of the maximum rank among certain submatrices of the graph's adjacency matrix determined by the partition.
asset allocations to take into account internal personnel movements and adjacency needs, among other factors.