Definitions
,
Results
,
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
▾
Path graph
▾
Finite path graph
▾
Cycle graph
▾
Set of cycle subgraphs
▾
Acyclic graph
Tree graph
Formulation 0
A
D778: Graph
$G$ is a
tree graph
if and only if
(1)
$G$ is an
D2747: Acyclic graph
(2)
$G$ is a
D2748: Connected graph
Also known as
Tree