rank graph
Смотреть что такое "rank graph" в других словарях:
Rank (graph theory) — In graph theory, a branch of mathematics, the rank of an undirected graph is defined as the number n − c, where n is the number of vertices and c is the number of connected components of the graph. Equivalently, the rank of a graph is the rank of … Wikipedia
Rank — is a very broad term with several meanings. As a noun it is usually related to a relative position or to some kind of ordering (see also ranking). As an adjective it is used to mean profuse, conspicuous, absolute, or unpleasant, especially in… … Wikipedia
Rank (mathematics) — Rank means a wide variety of things in mathematics, including: * Rank (linear algebra) * Rank of a tensor * Rank of an abelian group * Rank of a Lie group * Percentile rank * Rank (differential topology) * Rank of a vector bundle * Rank (set… … Wikipedia
Rank-size distribution — or the rank size rule (or law) describes the remarkable regularity in many phenomena including the distribution of city sizes around the world, sizes of businesses, particle sizes (such as sand), lengths of rivers, frequencies of word usage,… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Rank of a group — For the dimension of the Cartan subgroup, see Rank of a Lie group In the mathematical subject of group theory, the rank of a group G , denoted rank( G ), can refer to the smallest cardinality of a generating set for G , that is:… … Wikipedia
Rank abundance curve — A rank abundance curve is a chart used by ecologists to display indicators of biodiversity specifically species richness and species evenness. This is achieved using the relative abundances of different species in a sample. Rank abundance curves… … Wikipedia
Nullity (graph theory) — The nullity of a graph is defined as the number:: m = b n + cwhere b is the number of edges, n is the number of nodes and c the number of components. Equivalently, the nullity of a graph is the dimension of the null space of the oriented… … Wikipedia
Cycle rank — In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this concept measures how close a digraph is to a directed acyclic graph (DAG), in the sense that a … Wikipedia
Distance-hereditary graph — A distance hereditary graph. In graph theoretic mathematics, a distance hereditary graph (also called a completely separable graph)[1] is a graph in which the distances in any connected induced subgraph are the same as they are in the original… … Wikipedia
Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… … Wikipedia
