| Display title | Rank (graph theory) |
| Default sort key | Rank (graph theory) |
| Page length (in bytes) | 3,425 |
| Namespace ID | 0 |
| Page ID | 192368 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>JStaso |
| Date of page creation | 18:13, 6 February 2024 |
| Latest editor | imported>JStaso |
| Date of latest edit | 18:13, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | 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 graph.
In the matrix theory of graphs the rank r of an undirected graph is defined as the rank of its adjacency matrix.
Analogously, the nullity of the... |
