Last Updated：2025/11/22

(graph theory) The number of vertices in a minimum vertex cover of a graph, often denoted as 𝜏=𝜏(G).

音声機能が動作しない場合はこちらをご確認ください

See correct answer

covering number

Source Word

covering number

Noun

(graph theory) The number of vertices in a minimum vertex cover of a graph, often denoted as 𝜏=𝜏(G).

Japanese Meaning

グラフ理論における用語。グラフの頂点被覆（vertex cover）の中で、最小な頂点集合に含まれる頂点の数を示す（一般に𝜏=𝜏(G)と表記される）。

In this class of bipartite graphs, the covering number equals the size of a maximum matching by König's theorem.

このクラスの二部グラフでは、最小頂点被覆の頂点数はケーニッヒの定理により最大マッチングの大きさに等しい。

Sense（1）

(graph theory) The number of vertices in a minimum vertex cover of a graph, often denoted as 𝜏=𝜏(G).

covering numbers

（ plural ）