Rank (graph theory)
In graph theory, a branch of mathematics, the rank of an undirected graph has two unrelated definitions. Let n equal the number of vertices of the graph.
* In the matrix theory of graphs the rank r of an undirected graph is defined as the rank of its adjacency matrix.Analogously, the nullity of the graph is the nullity of its adjacency matrix, which equals n − r.
* In the matroid theory of graphs the rank of an undirected graph is defined as the number n − c, where c is the number of connected components of the graph. Equivalently, the rank of a graph is the rank of the oriented incidence matrix associated with the graph.Analogously, the nullity of the graph is the nullity of its oriented incidence matrix, given by the formula m − n + c, where n and c are as above and m is the number of
Wikipage disambiguates
primaryTopic
Rank (graph theory)
In graph theory, a branch of mathematics, the rank of an undirected graph has two unrelated definitions. Let n equal the number of vertices of the graph.
* In the matrix theory of graphs the rank r of an undirected graph is defined as the rank of its adjacency matrix.Analogously, the nullity of the graph is the nullity of its adjacency matrix, which equals n − r.
* In the matroid theory of graphs the rank of an undirected graph is defined as the number n − c, where c is the number of connected components of the graph. Equivalently, the rank of a graph is the rank of the oriented incidence matrix associated with the graph.Analogously, the nullity of the graph is the nullity of its oriented incidence matrix, given by the formula m − n + c, where n and c are as above and m is the number of
has abstract
Hodnost grafu je takové číslo, ...... hodnost rovnu počtu uzlů – 1.
@cs
In graph theory, a branch of m ...... ullity is the number of edges.
@en
Ранг неориентированного графа ...... га и дефекта даёт число рёбер.
@ru
Link from a Wikipage to an external page
Wikipage page ID
17,458,495
page length (characters) of wiki page
Wikipage revision ID
975,277,661
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
Hodnost grafu je takové číslo, ...... hodnost rovnu počtu uzlů – 1.
@cs
In graph theory, a branch of m ...... above and m is the number of
@en
Ранг неориентированного графа ...... га и дефекта даёт число рёбер.
@ru
label
Hodnost (graf)
@cs
Rank (graph theory)
@en
Ранг (теория графов)
@ru