Dense subgraph
Summary
In graph theory and computer science, a dense subgraph is a subgraph with many edges per vertex. This is formalized as follows: let be an undirected graph and let be a subgraph of . Then the density of is defined to be:
Further reading
- Wikipedia, page 32498620, revision 1369247313, Dense subgraph. adopted
About this page
| Tag | MRDXC2T6YP |
|---|---|
| URI | m2://MRDXC2T6YP |
| 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.