← Back to Top Articles

Minimum rank of a graph

30.89
/ 100
Stub/Needs Work

In mathematics, the minimum rank is a graph parameter mr ⁡ ( G ) {\displaystyle \operatorname {mr} (G)} for a graph G. It was motivated by the Colin de Verdière graph invariant.

View on Wikipedia →
3,600
Characters
0
Images
2
Categories
16
Links
0
Watchers
about 5 years ago
Last Edited

Detailed Scores

Length 39.5/100
Images 0/100
Categories 30.0/100
Links 48.3/100
Recency 10.3/100
Watchers 30/100
Structure 85/100

Recommendations

  • Add more content - article is quite short
  • Add more images to illustrate the topic
  • Add more categories to improve classification
  • Add more internal links to related articles
  • Article hasn't been updated recently - may need refreshing
  • Low watcher count - may need more visibility

Metadata

Page ID:
39378034
Discovered:
29 days ago