最終更新日
：2024/08/06
dual graph
noun
(graph
theory)
A
graph
derived
from
some
plane
graph
in
such
a
way
that
the
derived
graph
has
a
vertex
corresponding
to
each
face
of
the
given
graph,
an
edge
corresponding
to
each
edge
of
the
given
graph
that
is
shared
by
a
pair
of
distinct
faces,
and
a
self-loop
for
each
edge
of
the
given
graph
that
is
a
border
of
the
same
face
on
both
of
its
sides.
意味（1）
(graph
theory)
A
graph
derived
from
some
plane
graph
in
such
a
way
that
the
derived
graph
has
a
vertex
corresponding
to
each
face
of
the
given
graph,
an
edge
corresponding
to
each
edge
of
the
given
graph
that
is
shared
by
a
pair
of
distinct
faces,
and
a
self-loop
for
each
edge
of
the
given
graph
that
is
a
border
of
the
same
face
on
both
of
its
sides.
復習用の問題
(graph theory) A graph derived from some plane graph in such a way that the derived graph has a vertex corresponding to each face of the given graph, an edge corresponding to each edge of the given graph that is shared by a pair of distinct faces, and a self-loop for each edge of the given graph that is a border of the same face on both of its sides.
正解を見る
dual graph
The dual graph of a planar graph is a graph that has a vertex for each face of the original graph.
正解を見る
The dual graph of a planar graph is a graph that has a vertex for each face of the original graph.
English Dictionary
項目の編集設定
- 項目の編集権限を持つユーザー - すべてのユーザー
- 項目の新規作成を審査する
- 項目の編集を審査する
- 項目の削除を審査する
- 重複の恐れのある項目名の追加を審査する
- 項目名の変更を審査する
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
例文の編集設定
- 例文の編集権限を持つユーザー - すべてのユーザー
- 例文の削除を審査する
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
問題の編集設定
- 問題の編集権限を持つユーザー - すべてのユーザー
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
