OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Minimum rank of a graph

 Home Mathematics Fields of mathematics Algebra Algebraic graph theory
 0 By others on same topic  0 Discussions  1970-01-01  See my version
The minimum rank of a graph is a concept from algebraic graph theory that is associated with the graph's adjacency matrix or Laplacian matrix. Specifically, it refers to the smallest rank among all real symmetric matrices corresponding to the graph.

 Ancestors (5)

  1. Algebraic graph theory
  2. Algebra
  3. Fields of mathematics
  4. Mathematics
  5.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook