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
Definition D778
Graph
Formulation 0
An D548: Ordered pair $G = (X, \mathcal{E})$ is a graph if and only if
(1) $X$ is a D11: Set
(2) \begin{equation} \mathcal{E} \subseteq \{ E \subseteq X : |E| = 2 \} \end{equation}
Formulation 1
An D548: Ordered pair $G = (X, \mathcal{E})$ is a graph if and only if
(1) $X$ is a D11: Set
(2) \begin{equation} \mathcal{E} \subseteq \mathcal{P}_2(X) \end{equation}
Also known as
Undirected graph
Children
▶ D2731: Complete graph
▶ D5854: Digraph-generated graph
▶ D4551: Graph complement
▶ D4548: Graph homomorphism
▶ D4550: Graph intersection
▶ D4509: Graph tensor product
▶ D4549: Graph union
▶ D2737: Subgraph