Vertex connectivity
Summary
In graph theory, a connected graph is said to be -vertex-connected (or -connected) if it has more than vertices and remains connected whenever fewer than vertices are removed.
Further reading
- Wikipedia, page 7566175, revision 1352725487, Vertex connectivity. adopted
About this page
| Tag | V667Q0N945 |
|---|---|
| URI | m2://V667Q0N945 |
| Aliases | k-connected-graph, k-linked-graph |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.