Induced subgraph

In 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 connecting pairs of vertices in that subset.

Definition

Formally, let $G = (V, E)$ be any graph, and let $S \subset V$ be any subset of vertices of $G$ . Then the induced subgraph $G [S]$ is the graph whose vertex set is $S$ and whose edge set consists of all of the edges in $E$ that have both endpoints in $S$ .[1] The same definition works for undirected graphs, directed graphs, and even multigraphs.

The induced subgraph $G [S]$ may also be called the subgraph induced in $G$ by $S$ , or (if context makes the choice of $G$ unambiguous) the induced subgraph of $S$ .

Examples

Important types of induced subgraphs include the following.

The snake-in-the-box problem concerns the longest induced paths in hypercube graphs

Induced paths are induced subgraphs that are paths. The 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 or 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]
Cliques and independent sets are induced subgraphs that are respectively complete graphs or 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 induced subgraph isomorphism problem is a form of the subgraph isomorphism problem in which the goal is to test whether one graph can be found as an induced subgraph of another. Because it includes the clique problem as a special case, it is NP-complete.[4]

gollark: The update has been pushed to git, make sure to update forge to latest too.

gollark: Will we ever understand this mod author?

gollark: I've also updated the mods, local testing begins now.

gollark: I'll use PlusTiC, what could possibly go wrong.

gollark: There's Tinkegration, which adds a few somewhat reasonable modifiers, and PlusTIC, which adds lots of material support, somewhat weirdly and nonsensically, and also laser guns for some reason?

References

Diestel, Reinhard (2006), Graph Theory, Graduate texts in mathematics, 173, Springer-Verlag, pp. 3–4, ISBN 9783540261834.
Howorka, Edward (1977), "A characterization of distance-hereditary graphs", The Quarterly Journal of Mathematics. Oxford. Second Series, 28 (112): 417–420, doi:10.1093/qmath/28.4.417, MR 0485544.
Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006), "The strong perfect graph theorem", Annals of Mathematics, 164 (1): 51–229, arXiv:math/0212070, doi:10.4007/annals.2006.164.51, MR 2233847.
Johnson, David S. (1985), "The NP-completeness column: an ongoing guide", Journal of Algorithms, 6 (3): 434–451, doi:10.1016/0196-6774(85)90012-4, MR 0800733.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[1] Diestel, Reinhard (2006), Graph Theory, Graduate texts in mathematics, 173, Springer-Verlag, pp. 3–4, ISBN 9783540261834.

[2] Howorka, Edward (1977), "A characterization of distance-hereditary graphs", The Quarterly Journal of Mathematics. Oxford. Second Series, 28 (112): 417–420, doi:10.1093/qmath/28.4.417, MR 0485544.

[3] Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006), "The strong perfect graph theorem", Annals of Mathematics, 164 (1): 51–229, arXiv:math/0212070, doi:10.4007/annals.2006.164.51, MR 2233847.

[4] Johnson, David S. (1985), "The NP-completeness column: an ongoing guide", Journal of Algorithms, 6 (3): 434–451, doi:10.1016/0196-6774(85)90012-4, MR 0800733.