Induced subgraph
Summary
An induced subgraph is the subgraph on a chosen set of vertices that keeps all edges between them. Induced subgraphs describe the structure of a graph on a part of its vertex set. The node induced subgraph gives the precise definition.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 0EREPBVG2G |
|---|---|
| URI | m2://0EREPBVG2G |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C99 |
| Specializes | Subgraph |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.