The subgraph induced by a vertex set contains every edge of the original graph whose two endpoints lie in .

Ancestors (6)

  1. Subgraph
  2. Graph theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6. Home

Incoming links (16)

Synonyms (1)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Induced subgraph by Wikipedia Bot 1
View more
An **induced subgraph** is a concept from graph theory. Given a graph \( G = (V, E) \), where \( V \) is the set of vertices and \( E \) is the set of edges, an induced subgraph is formed by a subset of the vertices \( U \subseteq V \) along with all of the edges in \( E \) that have both endpoints in \( U \).
Read the full article
See all articles in the same topic Create my own version