C

Cycle space

Construction in graph theory

In graph theory, a branch of mathematics, the (binary) cycle space of an undirected graph is the set of its even-degree spanning subgraphs, or the set of their edge sets. This set of subgraphs can be described algebraically as a vector space over Z 2 {\displaystyle \mathbb {Z} _{2}} (the field with two elements).

Nº Q5198175 ★

Common · Knowledge

Cycle space

Construction in graph theory

In graph theory, a branch of mathematics, the (binary) cycle space of an undirected graph is the set of its even-degree spanning subgraphs, or the set of their edge sets. This set of subgraphs can be described algebraically as a vector space over Z 2 {\displaystyle \mathbb {Z} _{2}} (the field with two elements).

Last price

—

Floor price

—

7-day median

—

30-day sales

0

30-day range

—

In circulation

0

Price history

Show table
Datemedian LowHighsales

Sales history

Last sale
—
30-day average
—
30-day low
—
30-day high
—
Sales 7d
0
Sales 30d
0

No sales yet.

Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.

From Wikipedia

In graph theory, a branch of mathematics, the (binary) cycle space of an undirected graph is the set of its even-degree spanning subgraphs, or the set of their edge sets. This set of subgraphs can be described algebraically as a vector space over Z 2 {\displaystyle \mathbb {Z} _{2}} (the field with two elements). The dimension of this space is the circuit rank, or cyclomatic number, of the graph. The same space can also be described in terms from algebraic topology as the first homology group of the graph. Using homology theory, the binary cycle space may be generalized to cycle spaces over arbitrary rings.

Text: Wikipédia, CC BY-SA 4.0. ·

Related cards

View card

Confirmation