Skip to search formSkip to main contentSkip to account menu

Rank (graph theory)

Known as: Rank 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Abstract Saddle point problems with singular or indefinite pivot blockmatrix arise in various applications. In some problems it… 
2008
2008
0 Introduction. A Cmanifold M is endowed by a Poisson pair if two linearly independent smooth bivectors c1, c2 are defined on M… 
2007
2007
For a field F and graph G of order n, the minimum rank of G over F is defined to be the smallest possible rank over all symmetric… 
2005
2005
At present there are many methods that could deal well with frontal view face recognition when there is sufficient number of… 
1992
1992
A nongradient iterative algorithm that has reduced adaptive filter weight fluctuations caused by high variance input data is… 
Highly Cited
1991
Highly Cited
1991
Numerous computational examples suggest that if ℛk-1 ⊂ ℛk are (k- 1)- and k-nets of order n, then rankp ℛk - rankp ℛk-1 ≥ n - k… 
Highly Cited
1990
Highly Cited
1990
The work in this thesis is concerned with substructure coupling techniques which incorporate data readily available from modal… 
1988
1988
We prove that ifR is a one-dimensional ring, then each basic submodule of a freeR-moduleE contains a rank one projective summand… 
1983
1983
Let G be a group acting on a set X. Suppose that for some positive integer r, G contains a free group F of rank > r and the…