edge covering number

noun

(graph theory) The number of edges in a minimum edge cover of a graph, often denoted as 𝜌=𝜌(G).

The edge covering number of a graph is the minimum number of edges that need to be selected such that every vertex of the graph is incident to at least one selected edge.

Google翻訳 / DeepL翻訳

詳細

意味（1）

(graph theory) The number of edges in a minimum edge cover of a graph, often denoted as 𝜌=𝜌(G).

詳細

edge covering number

Dictionary quizzes to help you remember the meaning

ログイン / 新規登録

アプリをダウンロード！

edge covering number

Dictionary quizzes to help you remember the meaning

ログイン / 新規登録

ログイン

──── or ────

新規登録

──── or ────

アプリをダウンロード！