adjacency

  • 31Prim's algorithm — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional …

    Wikipedia

  • 32Spectral graph theory — In mathematics, spectral graph theory is the study of properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors of its adjacency matrix or Laplacian matrix. An undirected graph has a symmetric adjacency …

    Wikipedia

  • 33Two-graph — In mathematics, a two graph is a set of (unordered) triples chosen from a finite vertex set X , such that every (unordered) quadruple from X contains an even number of triples of the two graph. A regular two graph has the property that every pair …

    Wikipedia

  • 34Open Shortest Path First — (OSPF) is an adaptive routing protocol for Internet Protocol (IP) networks. It uses a link state routing algorithm and falls into the group of interior routing protocols, operating within a single autonomous system (AS). It is defined as OSPF… …

    Wikipedia

  • 35List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 …

    Wikipedia

  • 36Kronecker product — In mathematics, the Kronecker product, denoted by otimes, is an operation on two matrices of arbitrary size resulting in a block matrix. It is a special case of a tensor product. The Kronecker product should not be confused with the usual matrix… …

    Wikipedia

  • 37Distance matrix — In mathematics, computer science and graph theory, a distance matrix is a matrix (two dimensional array) containing the distances, taken pairwise, of a set of points. This matrix will have a size of N×N where N is the number of points, nodes or… …

    Wikipedia

  • 38Centrality — Within graph theory and network analysis, there are various measures of the centrality of a vertex within a graph that determine the relative importance of a vertex within the graph (for example, how important a person is within a social network …

    Wikipedia

  • 39Eigenvalue, eigenvector and eigenspace — In mathematics, given a linear transformation, an Audio|De eigenvector.ogg|eigenvector of that linear transformation is a nonzero vector which, when that transformation is applied to it, changes in length, but not direction. For each eigenvector… …

    Wikipedia

  • 40Geospatial topology — Topology In a Geographic Information System GIS, topology is a set of rules which define the relationship between points, lines, and polygons. ESRI enables topology generation within their geodatabase feature classes. Network topology explores… …

    Wikipedia