ThmDex – An index of mathematical definitions, results, and conjectures.
▼ Set of symbols
▼ Alphabet
▼ Deduction system
▼ Theory
▼ Zermelo-Fraenkel set theory
▼ Set
▼ Subset
▼ Power set
▼ Hyperpower set sequence
▼ Hyperpower set
▼ Hypersubset
▼ Subset algebra
▼ Subset structure
▼ Hypergraph
▼ Graph
Definition D2737
Subgraph
Formulation 0
Let $G_X = (X, \mathcal{E}_X)$ be a D778: Graph.
An D548: Ordered pair $G_E = (E, \mathcal{E}_E)$ is a subgraph of $G_X$ if and only if
(1) $E \subseteq X$ (D78: Subset)
(2) $\mathcal{E}_E \subseteq \mathcal{E}_X$ (D78: Subset)
Children
▶ D2745: Set of subgraphs
▶ D2740: Spanning subgraph
▶ D2738: Supergraph