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 ★

Común · Saberes

Cycle space

Construction in graph theory

Texto en inglés

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).

Último precio

—

Precio mínimo

—

Mediana 7 d

—

Ventas 30 d

0

Rango 30 d

—

En circulación

0

Cotización

Ver tabla
Fechamediana MínMáxventas

Historial de ventas

Última venta
—
Media 30 d
—
Mínimo 30 d
—
Máximo 30 d
—
Ventas 7 d
0
Ventas 30 d
0

Aún no hay ventas.

Ventas anónimas: sin comprador ni vendedor. Las cifras solo cuentan ventas entre jugadores.

En Wikipedia

Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.

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.

Texto: Wikipedia en inglés, CC BY-SA 4.0. ·

Cartas cercanas

Ver la ficha

Confirmación