Keywords

#induced_subgraph

Induced subgraph

Graph made from a subset of another graph's nodes and their edges

In the mathematical field of graph theory, an induced subgraph of a graph is another graph, formed from a subset of the vertices of the graph and all of the edges, from the original graph, connecting pairs of vertices in that subset.

Wed 10th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Induced subgraph Induced subgraph isomorphism problem Glossary of graph theory Maximum common induced subgraph Graph theory Forbidden graph characterization Tree-depth Ramsey's theorem Rado graph Clique (graph theory)
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.