Processing math: 100%
ThmDex – An index of mathematical definitions, results, and conjectures.
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
▼
Subgraph
▼
Path subgraph
▼
Finite path subgraph
▼
Graph connectivity relation
▼
Graph connected component
Definition D5853
Set of connected graph components
Formulation 0
Let
G
=
(
X
,
E
)
be a
D2742: Finite path graph
such that
(i)
↔
is a
D5851: Graph connectivity relation
for
G
The
set of connected components
for
G
is the
D180: Quotient set
X
/
↔
=
{
↔
(
x
)
:
x
∈
X
}
Formulation 1
Let
G
=
(
X
,
E
)
be a
D2742: Finite path graph
such that
(i)
↔
is a
D5851: Graph connectivity relation
for
G
The
set of connected components
for
G
is the
D180: Quotient set
X
/
↔
=
{
{
y
:
(
x
,
y
)
∈
↔
}
:
x
∈
X
}