Induced subgraph
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.
Definition
Formally, let be any graph, and let be any subset of vertices of G. Then the induced subgraph is the graph whose vertex set is and whose edge set consists of all of the edges in that have both endpoints in .[1] That is, for any two vertices , and are adjacent in if and only if they are adjacent in . The same definition works for
undirected graphs, directed graphs, and even multigraphs
.
The induced subgraph may also be called the subgraph induced in by , or (if context makes the choice of unambiguous) the induced subgraph of .
Examples
Important types of induced subgraphs include the following.
- shortest path between any two vertices in an unweighted graph is always an induced path, because any additional edges between pairs of vertices that could cause it to be not induced would also cause it to be not shortest. Conversely, in distance-hereditary graphs, every induced path is a shortest path.[2]
- Induced cycles are induced subgraphs that are cycles. The girth of a graph is defined by the length of its shortest cycle, which is always an induced cycle. According to the strong perfect graph theorem, induced cycles and their complements play a critical role in the characterization of perfect graphs.[3]
- edgeless graphs.
- Induced matchings are induced subgraphs that are matchings.
- The neighborhood of a vertex is the induced subgraph of all vertices adjacent to it.
Computation
The
NP-complete.[4]
References
- ISBN 9783540261834.
- MR 0485544.
- MR 2233847.
- MR 0800733.