Talk:Rank (graph theory)
This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
|
Reliable source
I am sorry to say it but MathWorld is not a reliable source. It has many errors, small and large. I recommend not using it as a reference. I don't see it serving a useful purpose in this article, anyway. Zaslav (talk) 09:27, 22 August 2016 (UTC)
Field adjacency matrix
The adjacency matrix usually consists of 0,1. As a consequence I believe to have seen the matrix-rank of a graph both over the booleans and over the reals. Probably this should be noted? In particular the rank of the triangle can be either 3 or 2. --Jochgem (talk) 09:19, 10 June 2024 (UTC)