Talk:Rank (graph theory)
Latest comment: 5 months ago by Jochgem in topic Field adjacency matrix
| This is the talk page for discussing improvements to the Rank (graph theory) article. This is not a forum for general discussion of the article's subject. |
Article policies
|
| Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
 | It is requested that a mathematical diagram or diagrams be included in this article to improve its quality. Specific illustrations, plots or diagrams can be requested at the Graphic Lab. For more information, refer to discussion on this page and/or the listing at Wikipedia:Requested images. |
Reliable source
editI 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
editThe 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)