adjacency

  • 41Distance-regular graph — Graph families defined by their automorphisms distance transitive distance regular strongly regular …

    Wikipedia

  • 42Modularity (networks) — For other uses, see Modularity. Modularity is one measure of the structure of networks or graphs. It measures the strength of division of a network into modules (also called groups, clusters or communities). Networks with high modularity have… …

    Wikipedia

  • 43Eigenvalues and eigenvectors — For more specific information regarding the eigenvalues and eigenvectors of matrices, see Eigendecomposition of a matrix. In this shear mapping the red arrow changes direction but the blue arrow does not. Therefore the blue arrow is an… …

    Wikipedia

  • 44Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges …

    Wikipedia

  • 45Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… …

    Wikipedia

  • 46Cuthill–McKee algorithm — In the mathematical subfield of matrix theory, the Cuthill–McKee algorithm (named for Elizabeth Cuthill and J. McKee) is an algorithm to reduce the bandwidth of sparse symmetric matrices. The reverse Cuthill–McKee algorithm (RCM) is the same… …

    Wikipedia

  • 47Signed graph — In the area of graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign.Formally, a signed graph Sigma; is a pair ( G , sigma;) that consists of a graph G = ( V , E ) and a sign mapping or… …

    Wikipedia

  • 48Permanent is sharp-P-complete — The correct title of this article is Permanent is #P complete. The substitution or omission of the # sign is because of technical restrictions. In a 1979 paper Leslie Valiant proved[1] that the problem of computing the permanent of a matrix is #P …

    Wikipedia

  • 49Tensor product of graphs — In graph theory, the tensor product G × H of graphs G and H is a graph such that * the vertex set of G × H is the Cartesian product V(G) × V(H) ; and * any two vertices (u,u ) and (v,v ) are adjacent in G × H if and only if u is adjacent with v… …

    Wikipedia

  • 50Logical matrix — A logical matrix, binary matrix, relation matrix, Boolean matrix, or (0,1) matrix is a matrix with entries from the Boolean domain B = {0, 1}. Such a matrix can be used to represent a binary relation between a pair of finite sets. Contents 1… …

    Wikipedia

  • 51Digital topology — deals with properties and features of two dimensional (2D) or three dimensional (3D) digital images that correspond to topological properties (e.g., connectedness) or topological features (e.g., boundaries) of objects. Concepts and results of… …

    Wikipedia

  • 52Forest of stars — A forest of stars is a set of star worlds whose adjacency matrix is a tree. This means that no intersecting star worlds create a cycle, or hole, in the overall space. If an object or space can be represented by a forest of stars, it can be mapped …

    Wikipedia

  • 53IFMP — Название: Ipsilon Flow Management Protocol Уровень (по модели OSI): Канальный Создан в: 1996 г. Спецификация: RFC 1953 IFMP (англ. Ipsilon Flow Management Protocol Протокол управления потоком …

    Википедия

  • 54Dependency network — Contents 1 Importance 2 Overview 3 The activity dependency networks …

    Wikipedia

  • 55Adjacence — Ad ja cence, Adjacency Ad*ja cen*cy, [Cf. LL. adjacentia.] 1. The state or attribute of being adjacent or contiguous; contiguity; the attribute of being so near as to be touching; as, the adjacency of lands or buildings. Syn: contiguousness [1913 …

    The Collaborative International Dictionary of English

  • 56Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …

    Wikipedia

  • 57Geographic information system — GIS redirects here. For other uses, see GIS (disambiguation). A geographic information system, geographical information science, or geospatial information studies is a system designed to capture, store, manipulate, analyze, manage, and present… …

    Wikipedia

  • 58PageRank — is a link analysis algorithm that assigns a numerical weighting to each element of a hyperlinked set of documents, such as the World Wide Web, with the purpose of measuring its relative importance within the set. The algorithm may be applied to… …

    Wikipedia

  • 59P-complete — In complexity theory, the notion of P complete decision problems is useful in the analysis of both: which problems are difficult to parallelize effectively, and; which problems are difficult to solve in limited space. Formally, a decision problem …

    Wikipedia

  • 60Regular graph — In graph theory, a regular graph is a graph where each vertex has the same number of neighbors, i.e. every vertex has the same degree or valency. A regular graph with vertices of degree k is called a kregular graph or regular graph of degree… …

    Wikipedia